-
Notifications
You must be signed in to change notification settings - Fork 53
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.
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
Schanen - restricted-array #31
base: master
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice work Schanen, you hit all the learning goals here. Well done.
@@ -8,56 +8,141 @@ | |||
# The restricted_array is terminated by 'nil' i.e. array[length] = nil | |||
# Time complexity: ? | |||
# Space complexity: ? | |||
# | |||
def length(array) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
end | ||
|
||
# Prints each integer values in the array | ||
# Time complexity: ? | ||
# Space complexity: ? | ||
# | ||
def print_array(array) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
while array[i] != nil | ||
puts array[i] | ||
i += 1 | ||
end | ||
end | ||
|
||
# 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) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
i += 1 | ||
end | ||
end | ||
return false | ||
end | ||
|
||
# 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) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
end | ||
i += 1 | ||
end | ||
return max_int | ||
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) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
end | ||
|
||
|
||
# Reverses the values in the integer array in place | ||
# Time complexity: ? | ||
# Space complexity: ? | ||
def reverse(array, length) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This works, but can you think of a way to do it without the hold 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.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
No description provided.