mirror of
https://github.com/TheAlgorithms/Ruby
synced 2024-12-27 21:58:57 +01:00
19 lines
461 B
Ruby
19 lines
461 B
Ruby
|
=begin
|
||
|
|
Looks through array for a value in O(n) time.
|
||
|
|
Array does not need to be sorted.
|
||
|
|
=end
|
||
|
|
def linear_search(array, key)
|
||
|
|
array.each_with_index do |current, index|
|
||
|
|
return index if current == key
|
||
|
|
end
|
||
|
|
return nil
|
||
|
|
end
|
||
|
|
|
||
|
|
puts "Enter a space-separated list:"
|
||
|
|
arr = gets.chomp.split(' ').map(&:to_i)
|
||
|
|
puts "Enter a value to be searched:"
|
||
|
|
key = gets.chomp.to_i
|
||
|
|
puts linear_search(arr, key) != nil ?
|
||
|
|
"Found at index #{linear_search(arr, key)}" :
|
||
|
|
"Not found"
|