Array Exercise-First go. #37
Open
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 22, 2020
Comment on lines
9
to
11
| # Time complexity: ? | ||
| # Space complexity: ? | ||
| def length(array) |
Comment on lines
20
to
23
| # Prints each integer values in the array | ||
| # Time complexity: ? | ||
| # Space complexity: ? | ||
| def print_array(array) |
Comment on lines
32
to
36
| # For an unsorted array, searches for 'value_to_find'. | ||
| # Returns true if found, false otherwise. | ||
| # Time complexity: ? | ||
| # Space complexity: ? | ||
| def search(array, length, value_to_find) |
Comment on lines
48
to
52
| # 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) |
Comment on lines
+60
to
+62
| if array[i] > largest_value | ||
| largest_value = array[i] | ||
| end |
There was a problem hiding this comment.
Suggested change
| if array[i] > largest_value | |
| largest_value = array[i] | |
| end | |
| if array[i] > largest_value | |
| largest_value = array[i] | |
| end |
| i += 1 | ||
| end | ||
| return largest_value | ||
| # raise NotImplementedError | ||
| 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) |
| i += 1 | ||
| end | ||
| return smallest_value | ||
| # raise NotImplementedError | ||
| end | ||
|
|
||
| # Reverses the values in the integer array in place | ||
| # Time complexity: ? | ||
| # Space complexity: ? | ||
| def reverse(array, length) |
Comment on lines
+129
to
+133
| if array[low] == value_to_find | ||
| return true | ||
| end | ||
| return false | ||
| # raise NotImplementedError |
There was a problem hiding this comment.
Some boolean Zen.
Suggested change
| if array[low] == value_to_find | |
| return true | |
| end | |
| return false | |
| # raise NotImplementedError | |
| return array[low] == value_to_find |
| rev -= 1 | ||
| end | ||
| return array | ||
| # raise NotImplementedError | ||
| 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) |
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.