Allie #920
Merged
Allie #920
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
First upload
Updated new version
New version, old version in 'Old' folder
solving issue 538
resolving issue #539
resolving issue #540
Resolving issue #823
CSC slides in markdown form. First upload
not needed
cards of act1
from master
Activity 10 - Word Networks w/ Tweets
…ryan) (Minesweeper Changes by Bryan)
This reverts commit cc9d371.
Bryan w
-doubly linked list big o analysis -zoologist (bubble, insertion, selection sort) big o analysis Closes #503 /spend 2 hr
mxthu313
suggested changes
Mar 25, 2020
| @@ -0,0 +1,9 @@ | |||
| Remember that Big O notation describes the behavior of functions as input grows, in this case as the number of elements in the doubly linked lists increases. | |||
|
|
|||
| The time complexity O(n) describes the behavior of the access and search functions on a doubly linked list. Here, **n** refers to the size of the input. So the greater the input, in this case the number of elements in the list, the more time these operations will take. | |||
There was a problem hiding this comment.
can you explain why? Like how the data structure (which is comprised of pointers) makes you do this?
|
|
||
| The time complexity O(n) describes the behavior of the access and search functions on a doubly linked list. Here, **n** refers to the size of the input. So the greater the input, in this case the number of elements in the list, the more time these operations will take. | ||
|
|
||
| The time complexity O(1) describes the behavior of insertion and deletion functions. This means that it takes constant time, or the same amount of time, no matter the amount of data in a doubly linked list. |
There was a problem hiding this comment.
can you also add why this is so?
|
|
||
| **Bubble Sort** | ||
|
|
||
| For bubble sort, there is a different time complexity for best case and worst case. This is important to note because that means that after a certain number of iterations, or elements to sort, this method becomes very inefficient. In the best case, the time it takes to sort is O(n), but this is only in the case that it sorts an already sorted list, because no sorting needs to happen. |
There was a problem hiding this comment.
can you possibly make references to the code snippets? Like "notice how there is a nested for loop" kind of thing?
|
|
||
| **Space Complexity** | ||
|
|
||
| Bubble sort, insertion sort and selection sort each have a space complexity of O(1). This is also referred to as constant space complexity, since it's the same no matter the amount of data they are sorting through. This is because they all sort "in place," that is, they are acting directly on the array. This means they don't have to use up extra memory storing anything in order to sort. |
|
|
||
| **Selection Sort** | ||
|
|
||
| Selection sort has basically the same time complexity as bubble and insertion sort, except it doesn't have an improved best case. It always takes O(n^2) time, even when sorting an already sorted list, so this is probably the least efficient of the three methods. However, it takes O(n^2) time in every other case, just like the other two functions, so it performs the same most of the time. |
|
|
||
| **Insertion Sort** | ||
|
|
||
| Insertion sort has the same time complexity breakdown as bubble sort. Best case scenario, it'll sort a sorted list, making O(n) time. |
mxthu313
added
Stage 2: Post-Review
…Allie "pulling from michelle"
- 3.md checkpoint
- minor changes - explaining code behind Big O Closes #503 /spend 30 m
|
Can you add the closes tags in a comment? thanks |
|
hey sorry just did it — is that how you wanted me to do it?
Allie
…On Sat, Mar 28, 2020 at 9:03 PM michelle ***@***.***> wrote:
Can you add the closes tags in a comment? thanks
—
You are receiving this because you authored the thread.
Reply to this email directly, view it on GitHub
<#920 (comment)>,
or unsubscribe
<https://github.com/notifications/unsubscribe-auth/AOMDOAXGRUUWE3KJD47CPTLRJ3CAZANCNFSM4LTE73SA>
.
|
mxthu313
approved these changes
Mar 30, 2020
perfect. can you fix your merge conflicts? lmk if you need help with that |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Closes #503
Closes #622
Closes #922
Closes #923
Closes #927
Closes #928
Closes #929
Closes #932
Closes #933
...
Changes proposed in this pull request:
/spend 2 hr
@reviewer/kavuong