Skip to content
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

Elizabeth Deutsch - Restricted Array Methods #7

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Elizabeth Deutsch - Restricted Array Methods #7

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
130 changes: 121 additions & 9 deletions using_restricted_array.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,28 +8,94 @@

## Calculates the length of the restricted integer array_size
def length(array)
puts "NOT IMPLEMENTED"
if array[0] == nil
return nil
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This should return 0. The length will be 0 if the array is empty.

else
count = 0
i = 0
while (array[i] != nil)
count += 1
i += 1
end
return count
end
end

# Prints each integer values in the array
def print_array(array)
puts "NOT IMPLEMENTED"
if array[0] == nil
print "This is an empty array."
else
i = 0
while (array[i] != nil)
print "\n"
print array[i]
i += 1
end
end
end

# Reverses the values in the integer array
def reverse(array, length) # Ruby
puts "NOT IMPLEMENTED"
if array[0] == nil
print "This is an empty array."
else
print "\n"
i = 0
j = length - 1
while i < j
temp = array[i]
array[i] = array[j]
array[j] = temp
i += 1
j -= 1
end
end
return array
end

# For an unsorted array, searches for 'value_to_find'.
# Returns true if found, false otherwise.
def search(array, length, value_to_find)
puts "NOT IMPLEMENTED"
if array[0] == nil
print "This is an empty array."
else
i = 0
while (array[i] != nil)
if array[i] == value_to_find
return true
else
i += 1
end
end
return false
end
end

# Sorts the array in ascending order.
def sort(array, length)
puts "NOT IMPLEMENTED"
if length == 0
print "This is an empty array."
else
i = 0
until i == length - 1
j = i + 1
min_index = i
until j == length
if array[min_index] > array[j]
min_index = j
j += 1
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Minor: you could end the conditional statement after updating min_index. And have j += 1 outside the conditional since it applies in both the if case and the else case.

else
j += 1
end
end
temp = array[i]
array[i] = array[min_index]
array[min_index] = temp
i += 1
end
return array
end
end

# Restricted arrays cannot be resized. So, we follow a convention.
Expand All @@ -38,20 +104,50 @@ def sort(array, length)
# constant, adds an element with 'SPECIAL_VALUE' in the end. Assumes the array
# to be sorted in ascending order.
def delete(array, length, value_to_delete)
puts "NOT IMPLEMENTED"
if array[0] == nil
print "This is an empty array."
else
i = 0
until array[i] > value_to_delete || array[i] == array[length - 1]
if array[i] == value_to_delete
array[i] = SPECIAL_VALUE
end
i += 1
end
end
sort(array, length)
return array
end

# Restricted array cannot be resized. So, we workaround by having a convention
# Convention: replace all values with 'SPECIAL_VALUE'
# Empties the restricted array by making all values = SPECIAL_VALUE
def empty(array, length)
puts "NOT IMPLEMENTED"
if array[0] == nil
print "This is an empty array."
else
i = 0
while (array[i] != nil)
array[i] = SPECIAL_VALUE
i += 1
end
end
end

# Finds and returns the largest value element in the array which is not 'SPECIAL_VALUE'
# Assumes that the array is not sorted.
def find_largest(array, length)
puts "NOT IMPLEMENTED"
if array[0] == nil
print "This is an empty array."
else
max_val = array[0]
length.times do |i|
if array[i] > max_val && array[i] != SPECIAL_VALUE
max_val = array[i]
end
end
return max_val
end
end

# Insert value to insert at the correct index into the array assuming the array
Expand All @@ -60,7 +156,21 @@ def find_largest(array, length)
# (Hint: if there are elements with 'SPECIAL_VALUE', there is no room to insert)
# All subsequent elements will need to be moved forward by one index.
def insert_ascending(array, length, value_to_insert)
puts "NOT IMPLEMENTED"
if array[0] == nil
print "This is an empty array."
elsif array[length - 1] != SPECIAL_VALUE
print "There is no room in this array."
else
i = 0
until array[i] == SPECIAL_VALUE
i += 1
end
if array[i] == SPECIAL_VALUE
array[i] = value_to_insert
end
end
sort(array, length)
return array
end

## --- END OF METHODS ---
Expand Down Expand Up @@ -144,6 +254,7 @@ def insert_ascending(array, length, value_to_insert)
print_array(another_array)
puts

## not working
# insert 123 in to the array sorted in ascending order
value_to_insert = 123
insert_ascending(another_array, another_array_length, value_to_insert)
Expand All @@ -157,6 +268,7 @@ def insert_ascending(array, length, value_to_insert)
print_array(another_array)
puts

## not working
# insert 123 in to the array sorted in ascending order
value_to_insert = 123
insert_ascending(another_array, another_array_length, value_to_insert)
Expand Down