summaryrefslogtreecommitdiff
path: root/lib/sorting
diff options
context:
space:
mode:
authormo khan <mo@mokhan.ca>2013-09-04 21:59:29 -0600
committermo khan <mo@mokhan.ca>2013-09-04 21:59:29 -0600
commit4bfddb71e76d931b716242b136ee143f8e1ce679 (patch)
tree1b9965a39ff8722807e67bf241959f044ca7ac17 /lib/sorting
parent083ac9b472c2c45033fb2c1bd1df944f34db1877 (diff)
use Array#sample instead of finding a random pivot.
Diffstat (limited to 'lib/sorting')
-rw-r--r--lib/sorting/quick_sort.rb3
1 files changed, 2 insertions, 1 deletions
diff --git a/lib/sorting/quick_sort.rb b/lib/sorting/quick_sort.rb
index d24b33c..71e414e 100644
--- a/lib/sorting/quick_sort.rb
+++ b/lib/sorting/quick_sort.rb
@@ -2,7 +2,8 @@ class QuickSort
def sort(items)
return items if items.size <= 1
- pivot = items[rand(items.size)]
+ #pivot = items[rand(items.size)]
+ pivot = items.sample
less, pivots, greater = [], [], []
items.each do |x|
if x < pivot