Branches - Erika #46
Open
Branches - Erika #46
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
CheezItMan
reviewed
Sep 18, 2019
| # Time complexity: ? | ||
| # Space complexity: ? | ||
| # Time complexity: O(n) - constant | ||
| # Space complexity: O(n) |
There was a problem hiding this comment.
Since you are not building a new array this space complexity is O(1)
| @@ -6,56 +6,102 @@ | |||
|
|
|||
| # Calculates the length of the restricted array. All values are integers. | |||
| # The restricted_array is terminated by 'nil' i.e. array[length] = nil | |||
| # Time complexity: ? | |||
| # Space complexity: ? | |||
| # Time complexity: O(n) - constant | |||
| end | ||
|
|
||
| # Prints each integer values in the array | ||
| # Time complexity: ? | ||
| # Space complexity: ? | ||
| def print_array(array) | ||
| raise NotImplementedError | ||
| index = 0 | ||
| array.length.times do |
There was a problem hiding this comment.
To use your length method this should be length(array).times
| array.length.times do | ||
| value = array[index] | ||
| print "#{value} " | ||
| end | ||
| end | ||
|
|
||
| # For an unsorted array, searches for 'value_to_find'. | ||
| # Returns true if found, false otherwise. | ||
| # Time complexity: ? |
| # Finds and returns the largest integer value the array | ||
| # Assumes that the array is not sorted. | ||
| # Time complexity: ? | ||
| # Space complexity: ? | ||
| def find_largest(array, length) | ||
| raise NotImplementedError | ||
| current = 0 |
There was a problem hiding this comment.
What if the array holds negative numbers?
I suggest starting current at array[0]
| end | ||
|
|
||
| # Finds and returns the smallest integer value in the array | ||
| # Assumes that the array is not sorted. | ||
| # Time complexity: ? | ||
| # Space complexity: ? | ||
| def find_smallest(array, length) | ||
| raise NotImplementedError | ||
| current = array[0] |
| f_index = 0 | ||
| b_index = length - 1 | ||
| while f_index < b_index | ||
| array[f_index], array[b_index] = array[b_index], array[f_index] |
| f_index += 1 | ||
| b_index -= 1 | ||
| end | ||
| return array | ||
| end | ||
|
|
||
| # For an array sorted in ascending order, searches for 'value_to_find'. | ||
| # Returns true if found, false otherwise. | ||
| # Time complexity: ? | ||
| # Space complexity: ? | ||
| def binary_search(array, length, value_to_find) |
There was a problem hiding this comment.
This does may work, but it is not binary search. Check out my implementation of Binary Search
| f_index += 1 | ||
| b_index -= 1 | ||
| end | ||
| return array | ||
| end | ||
|
|
||
| # For an array sorted in ascending order, searches for 'value_to_find'. | ||
| # Returns true if found, false otherwise. | ||
| # Time complexity: ? |
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.
No description provided.