GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Python/sorts/random_pivot_quick_sort.py at master · https-github-com-nzysoft/Python Expand file tree/ Copy pathrandom_pivot_quick_sort.pyMore file actions 44 lines (34 loc) · 1.15 KB / Copy pathrandom_pivot_quick_sort.pyFile metadata and controls44 lines (34 loc) · 1.15 KB 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 """ Picks the random index as the pivot """ import random def partition(a, left_index, right_index): pivot = a[left_index] i = left_index + 1 for j in range(left_index + 1, right_index): if a[j] < pivot: a[j], a[i] = a[i], a[j] i += 1 a[left_index], a[i - 1] = a[i - 1], a[left_index] return i - 1 def quick_sort_random(a, left, right): if left < right: pivot = random.randint(left, right - 1) a[pivot], a[left] = ( a[left], a[pivot], ) # switches the pivot with the left most bound pivot_index = partition(a, left, right) quick_sort_random( a, left, pivot_index ) # recursive quicksort to the left of the pivot point quick_sort_random( a, pivot_index + 1, right ) # recursive quicksort to the right of the pivot point def main(): user_input = input("Enter numbers separated by a comma:\n").strip() arr = [int(item) for item in user_input.split(",")] quick_sort_random(arr, 0, len(arr)) print(arr) if __name__ == "__main__": main() |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |