finalize main repo description

fix print statement to match req; check if array null before initiate var

account for edge case of more prints before square index

add interpolation search algo

time complexity for jump search is O(sqrt(n))

account for null array

add jump search algo

add function prototype to header

space complexity of binary search of n is O(1)

space complexity for linear search is O(1)

add a new line at end

betty style fix

betty style fix

time complexity to malloc n, loop through, then malloc m is O(nm)

space complexity for binary search is O(n)