mirror of
https://github.com/TheAlgorithms/Ruby
synced 2025-01-16 03:43:19 +01:00
15 lines
444 B
Ruby
15 lines
444 B
Ruby
def quicksort(arr)
|
|
return [] if arr.empty?
|
|
|
|
# chose a random pivot value
|
|
pivot = arr.delete_at(rand(arr.size))
|
|
# partition array into 2 arrays and comparing them to each other and eventually returning
|
|
# array with the pivot value sorted
|
|
left, right = arr.partition(&pivot.method(:>))
|
|
|
|
# recursively calling the quicksort method on itself
|
|
[*quicksort(left), pivot, *quicksort(right)]
|
|
end
|
|
|
|
arr = [34, 2, 1, 5, 3]
|
|
p quicksort(arr)
|