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 — algorithms/algorithms/sort/gnome_sort.py at master · oldmonad/algorithms Expand file tree/ Copy pathgnome_sort.pyMore file actions 19 lines (15 loc) · 365 Bytes / Copy pathgnome_sort.pyFile metadata and controls19 lines (15 loc) · 365 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 """ Gnome Sort Best case performance is O(n) Worst case performance is O(n^2) """ def gnome_sort(arr): n = len(arr) index = 0 while index < n: if index == 0 or arr[index] >= arr[index-1]: index = index + 1 else: arr[index], arr[index-1] = arr[index-1], arr[index] index = index - 1 return arr |
| 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. |