Brenna's PR

using_restricted_array.rb

@@ -8,28 +8,71 @@
 
 ## Calculates the length of the restricted integer array_size
 def length(array)
-  puts "NOT IMPLEMENTED"
+  i = 0
+  length = 0
+
+  while array[i]
+    length += 1
+    i += 1
+  end
+
+  return length
 end
 
 # Prints each integer values in the array
 def print_array(array)
-  puts "NOT IMPLEMENTED"
+  length = length(array)
+  for i in 0...length
+    puts "element @ #{i} is #{array[i]}"
+    i += 1
+  end
 end
 
 # Reverses the values in the integer array
 def reverse(array, length) # Ruby
-  puts "NOT IMPLEMENTED"
+  return array if length < 2
+
+  i = 0
+  j = length - 1
+
+  while i < j
+    temp = array[i]
+    array[i] = array[j]
+    array[j] = temp
+
+    i += 1
+    j -= 1
+  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"
+  for i in 0...length
+    return true if array[i] == value_to_find
+  end
+
+  return false
 end
 
 # Sorts the array in ascending order.
 def sort(array, length)
-  puts "NOT IMPLEMENTED"
+  return array if length < 2
+
+  for i in 0...length
+    min_index = i
+    for j in (i + 1)...length
+      if array[j] < array[min_index]
+        temp = array[j]
+        array[j] = array[min_index]
+        array[min_index] = temp
+      end
+    end
+  end
+
+  return array
 end
 
 # Restricted arrays cannot be resized. So, we follow a convention.
@@ -38,29 +81,65 @@ 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"
+  return array[0] = SPECIAL_VALUE if length < 2
+
+  for i in 0...length
+    if array[i] == value_to_delete
+        array[i] = SPECIAL_VALUE
+    end
+  end
+  return sort(array, length)
 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"
+  for i in 0...length
+    array[i] = SPECIAL_VALUE
+  end
+
+  return array
 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"
+  return array[0] if length < 2
+
+  i = length - 1
+  while array[i] == SPECIAL_VALUE
+    i -= 1
+  end
+  return array[i]
 end
 
 # Insert value to insert at the correct index into the array assuming the array
 # is sorted in ascending manner.
 # Restricted arrays cannot be resized. Insert only if there is space in the array.
-# (Hint: if there are elements with 'SPECIAL_VALUE', there is no room to insert)
+# (Hint: if there are no 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"
+  return if array[length - 1] != SPECIAL_VALUE
+
+  inserted = false
+  temp = nil
+
+  for i in 0...length
+    temp, array[i] = array[i], temp if inserted
+
+    if value_to_insert <= array[i] && !inserted
+      temp = array[i]
+      array[i] = value_to_insert
+      inserted = true
+      i += 1
+    end
+
+    if array[i] == SPECIAL_VALUE
+      array[i] = inserted ? temp : value_to_insert
+      return array 
+    end
+  end
 end
 
 ## --- END OF METHODS ---