# starting condition
list = [ ]
# as the question
puts 'Enter a list of words, press \'enter\' to quit and they will be returned randomly shuffled.'
word = 'one'
# get the words in the first list
while word != ''
word = gets.chomp
list.push word
end
# define shuffle method
def shuffle array
# starting conditions of local variables
randomized = [ ]
count = -2
x = 0
y = 0
array.each do |word|
count = count + 1
end
while y <= count
x = rand(count+1)
if array[x] != 'used'
randomized.push array[x]
array [x] = 'used'
y = y + 1
end
end
puts randomized
end
shuffle list
2. Dictionary sort method.
# starting condition
list = [ ]
# ask the question
puts 'Enter a list of words, press \'enter\' to quit and they will be returned sorted.'
word = 'one'
# get the words in the first list
while word != ''
word = gets.chomp
list.push word
end
# sort definition wrapper method
def sort array
count = -2
# count number of words in first list
array.each do |word|
count = count + 1
end
recursive_sort(array, [ ], [ ], count)
end
# recursive sort method definition
def recursive_sort listA, listB, sorted, nums
# local variables
x = 0
y = 0
z = 0
# cycle I
while x <= nums
if listA[x].downcase <= listA[y].downcase
y = y + 1
if y == nums + 1
sorted.push listA[x]
x = x + 1
y = 0
z = z + 1
end
else
listB.push listA[x]
x = x + 1
y = 0
end
end
# cycle II
nums = nums - z
listA = [ ]
x = 0
y = 0
z = 0
if nums < 0
x = nums + 5
end
while x <= nums
if listB[x].downcase <= listB[y].downcase
y = y + 1
if y == nums + 1
sorted.push listB[x]
x = x + 1
y = 0
z = z + 1
end
else
listA.push listB[x]
x = x + 1
y = 0
end
end
nums = nums - z
x = 0
y = 0
z = 0
if nums < 0
puts 'sorted list: '
puts sorted
else recursive_sort(listA, [ ], sorted, nums)
end
end
sort list
