Skip to content

Commit 2ddb584

Browse files
committed
add doctest to median_of_3 function
1 parent ccc7fc3 commit 2ddb584

File tree

1 file changed

+11
-11
lines changed

1 file changed

+11
-11
lines changed

sorts/intro_sort.py

Lines changed: 11 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -72,6 +72,16 @@ def median_of_3(
7272
7373
>>> median_of_3(array, 0, 0 + ((len(array) - 0) // 2) + 1, len(array) - 1)
7474
12
75+
76+
>>> array = [13, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12]
77+
78+
>>> median_of_3(array, 0, 0 + ((len(array) - 0) // 2) + 1, len(array) - 1)
79+
13
80+
81+
>>> array = [4, 2, 6, 8, 1, 7, 8, 22, 15, 14, 27, 79, 23, 45, 14, 16]
82+
83+
>>> median_of_3(array, 0, 0 + ((len(array) - 0) // 2) + 1, len(array) - 1)
84+
14
7585
"""
7686
if (array[first_index] > array[middle_index]) != (
7787
array[first_index] > array[last_index]
@@ -91,16 +101,6 @@ def partition(array: list, low: int, high: int, pivot: int) -> int:
91101
92102
>>> partition(array, 0, len(array), 12)
93103
8
94-
95-
>>> array = [13, 2, 6, 8, 1, 7, 8, 22, 14, 56, 27, 79, 23, 45, 14, 12]
96-
97-
>>> median_of_3(array, 0, 0 + ((len(array) - 0) // 2) + 1, len(array) - 1)
98-
13
99-
100-
>>> array = [4, 2, 6, 8, 1, 7, 8, 22, 15, 14, 27, 79, 23, 45, 14, 16]
101-
102-
>>> median_of_3(array, 0, 0 + ((len(array) - 0) // 2) + 1, len(array) - 1)
103-
14
104104
"""
105105
i = low
106106
j = high
@@ -170,7 +170,7 @@ def intro_sort(
170170
p = partition(array, start, end, pivot)
171171
intro_sort(array, p, end, size_threshold, max_depth)
172172
end = p
173-
return end
173+
return insertion_sort(array, start, end)
174174

175175

176176
if __name__ == "__main__":

0 commit comments

Comments
 (0)