Some algorithms to sort a simple list in Python 2.7
1) Using Example:
$python sort.py x < F > O
x-> For choosing which method to use.
- Selection Sort : 1
- Insertion Sort : 2
- Merge Sort : 3
- Quick Sort : 4
- Heap Sort : 5
- Count Sort : 6
- Radix Sort : 7
- Bucket Sort : 8
F-> Filename with the numbers to be sorted.
O-> Filename that will storage the numbers after sort algorithm.
2) File must have just one number in each line followed by a break-line
Example:
4
103
-10
30
-5
34
...