3 ms·
> If you come up with a fast sorting algorithm how would you go about making a case it's faster than currently used ones on real world data? For analysing sort
by justinclift 8y ago
> If you come up with a fast sorting algorithm how would you go about making a case it's faster than currently used ones on real world data?
For analysing sorting algorithms - and related things which that leads into - there are established ways to determine their best, average, and worst case runtimes for input of a given size.
If you're interested in learning this stuff, the video's here are useful and not math heavy:
https://www.coursera.org/learn/algorithms-part1 https://www.coursera.org/learn/algorithms-part1
Technically it's explained using java. But it's mostly done using primitive data types (eg int, float, byte, ...).
So it's very easy to follow along and copy the implementation, but translated to a different language (Go in my case, as I don't do java at all).