|
1 |
| -""" https://en.wikipedia.org/wiki/Cocktail_shaker_sort """ |
| 1 | +""" |
| 2 | +An implementation of the cocktail shaker sort algorithm in pure Python. |
2 | 3 |
|
| 4 | +https://en.wikipedia.org/wiki/Cocktail_shaker_sort |
| 5 | +""" |
3 | 6 |
|
4 |
| -def cocktail_shaker_sort(unsorted: list) -> list: |
| 7 | + |
| 8 | +def cocktail_shaker_sort(arr: list[int]) -> list[int]: |
5 | 9 | """
|
6 |
| - Pure implementation of the cocktail shaker sort algorithm in Python. |
| 10 | + Sorts a list using the Cocktail Shaker Sort algorithm. |
| 11 | +
|
| 12 | + :param arr: List of elements to be sorted. |
| 13 | + :return: Sorted list. |
| 14 | +
|
7 | 15 | >>> cocktail_shaker_sort([4, 5, 2, 1, 2])
|
8 | 16 | [1, 2, 2, 4, 5]
|
9 |
| -
|
10 | 17 | >>> cocktail_shaker_sort([-4, 5, 0, 1, 2, 11])
|
11 | 18 | [-4, 0, 1, 2, 5, 11]
|
12 |
| -
|
13 | 19 | >>> cocktail_shaker_sort([0.1, -2.4, 4.4, 2.2])
|
14 | 20 | [-2.4, 0.1, 2.2, 4.4]
|
15 |
| -
|
16 | 21 | >>> cocktail_shaker_sort([1, 2, 3, 4, 5])
|
17 | 22 | [1, 2, 3, 4, 5]
|
18 |
| -
|
19 | 23 | >>> cocktail_shaker_sort([-4, -5, -24, -7, -11])
|
20 | 24 | [-24, -11, -7, -5, -4]
|
| 25 | + >>> cocktail_shaker_sort(["elderberry", "banana", "date", "apple", "cherry"]) |
| 26 | + ['apple', 'banana', 'cherry', 'date', 'elderberry'] |
| 27 | + >>> cocktail_shaker_sort((-4, -5, -24, -7, -11)) |
| 28 | + Traceback (most recent call last): |
| 29 | + ... |
| 30 | + TypeError: 'tuple' object does not support item assignment |
21 | 31 | """
|
22 |
| - for i in range(len(unsorted) - 1, 0, -1): |
| 32 | + start, end = 0, len(arr) - 1 |
| 33 | + |
| 34 | + while start < end: |
23 | 35 | swapped = False
|
24 | 36 |
|
25 |
| - for j in range(i, 0, -1): |
26 |
| - if unsorted[j] < unsorted[j - 1]: |
27 |
| - unsorted[j], unsorted[j - 1] = unsorted[j - 1], unsorted[j] |
| 37 | + # Pass from left to right |
| 38 | + for i in range(start, end): |
| 39 | + if arr[i] > arr[i + 1]: |
| 40 | + arr[i], arr[i + 1] = arr[i + 1], arr[i] |
28 | 41 | swapped = True
|
29 | 42 |
|
30 |
| - for j in range(i): |
31 |
| - if unsorted[j] > unsorted[j + 1]: |
32 |
| - unsorted[j], unsorted[j + 1] = unsorted[j + 1], unsorted[j] |
| 43 | + if not swapped: |
| 44 | + break |
| 45 | + |
| 46 | + end -= 1 # Decrease the end pointer after each pass |
| 47 | + |
| 48 | + # Pass from right to left |
| 49 | + for i in range(end, start, -1): |
| 50 | + if arr[i] < arr[i - 1]: |
| 51 | + arr[i], arr[i - 1] = arr[i - 1], arr[i] |
33 | 52 | swapped = True
|
34 | 53 |
|
35 | 54 | if not swapped:
|
36 | 55 | break
|
37 |
| - return unsorted |
| 56 | + |
| 57 | + start += 1 # Increase the start pointer after each pass |
| 58 | + |
| 59 | + return arr |
38 | 60 |
|
39 | 61 |
|
40 | 62 | if __name__ == "__main__":
|
|
0 commit comments