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/InsertionSort.py at master · techscientist/Python Expand file tree/ Copy pathInsertionSort.pyMore file actions 25 lines (18 loc) · 329 Bytes / Copy pathInsertionSort.pyFile metadata and controls25 lines (18 loc) · 329 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 array=[]; # input print ("Enter any 6 Numbers for Unsorted Array : "); for i in range(0, 6): n=input(); array.append(int(n)); # Sorting print("") for i in range(1, 6): temp=array[i] j=i-1; while(j>=0 and temp<array[j]): array[j+1]=array[j]; j-=1; array[j+1]=temp; # Output for i in range(0,6): print(array[i]); |
| 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. |