Skip to content

Matt Wright - Sprint-Data-Structures #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

Matt Wright - Sprint-Data-Structures #1

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
547c4cf
initial commit
mattwright42 Mar 1, 2019
a8f76e9
completes binary_search_tree with breadth_first_for_each
mattwright42 Mar 1, 2019
ae2f480
adds optimization down to 2 seconds (from 11 seconds)
mattwright42 Mar 1, 2019
3af5de5
completes names with some optimized runtimes
mattwright42 Mar 1, 2019
d7ac76b
Completes Data_Structures_Answers
mattwright42 Mar 1, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Completes Data_Structures_Answers
  • Loading branch information
@mattwright42
mattwright42 committed Mar 1, 2019
commit d7ac76baa7e89486007a2a34d0366647e0012269
17 changes: 8 additions & 9 deletions Data_Structures_Answers.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,18 +1,17 @@
Add your answers to the questions below.

1. What is the runtime complexity of your `depth_first_for_each` method?
1. What is the runtime complexity of your `depth_first_for_each` method? N/A

2. What is the space complexity of your `depth_first_for_each` function?
2. What is the space complexity of your `depth_first_for_each` function? N/A

3. What is the runtime complexity of your `breadth_first_for_each` method?
3. What is the runtime complexity of your `breadth_first_for_each` method? This will be O(n) as it is visiting each node once.

4. What is the space complexity of your `breadth_first_for_each` method?
4. What is the space complexity of your `breadth_first_for_each` method? This will be O(n) because the size of the queue scales with the size of the tree.

5) What is the runtime complexity of the provided code in `names.py`? O(n \*\* 2) from the nested loop.

5. What is the runtime complexity of the provided code in `names.py`?
6) What is the space complexity of the provided code in `names.py`? I think this is O(n) because the size of the duplicates array increases with the size of the 'names' files.

6. What is the space complexity of the provided code in `names.py`?
7) What is the runtime complexity of your optimized code in `names.py`? I think O(n) - it is running the function once?

7. What is the runtime complexity of your optimized code in `names.py`?

8. What is the space complexity of your optimized code in `names.py`?
8) What is the space complexity of your optimized code in `names.py`? O(n)
2 changes: 2 additions & 0 deletions Pipfile
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,8 @@ url = "https://pypi.org/simple"
verify_ssl = true

[dev-packages]
pylint = "*"
autopep8 = "*"

[packages]

Expand Down
120 changes: 118 additions & 2 deletions Pipfile.lock
View file
Open in desktop

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.