Programming

qsort is the fastest sorting method, but it's not the most accurate. Forgive me, I don't remember the exact code, but the idea is to divide the array into many small groups and sort the members of each group in ascending (or descending) order. Then, we sort the groups themselves. For an array containing 1,000,000,000 members, this will be much faster than a standard sort, but there's a possibility of errors with a large number of repeating groups. Your sorting approach is completely different. But your program, although I haven't tested it with specific examples yet, will most likely be slower than qsort. Basically, you have a standard sort (I apologize, I didn't understand it at first) with some new features. I was too quick to congratulate you; I apologize, but your solution is standard.
Do you want me to post the qsort code?