- Notifications
You must be signed in to change notification settings - Fork 4
/
Copy path0912-sort-an-array.rb
50 lines (42 loc) · 1.01 KB
/
0912-sort-an-array.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
# frozen_string_literal: true
# 912. Sort an Array
# https://leetcode.com/problems/sort-an-array
# @param {Integer[]} nums
# @return {Integer[]}
defsort_array(nums)
in_place_quick_sort(nums,0,nums.length - 1)
nums
end
defin_place_quick_sort(nums,l,r)
returnifl >= r
pivot=nums[rand(l..r)]
pl,pr=partition(nums,l,r,pivot)
in_place_quick_sort(nums,l,pl - 1)
in_place_quick_sort(nums,pr + 1,r)
end
defpartition(nums,l,r,pivot)
p0,p1,p2=l,l,r
whilep1 <= p2
ifnums[p1] < pivot
nums[p0],nums[p1]=nums[p1],nums[p0]
p0 += 1
p1 += 1
elsifnums[p1] == pivot
p1 += 1
else
nums[p1],nums[p2]=nums[p2],nums[p1]
p2 -= 1
end
end
[p0,p2]
end
# ********************#
# TEST #
# ********************#
require"test/unit"
classTest_sort_array < Test::Unit::TestCase
deftest_
assert_equal[1,2,3,5],sort_array([5,2,3,1])
assert_equal[0,0,1,1,2,5],sort_array([5,1,1,2,0,0])
end
end