Compare sorting algorithms' performance: Difference between revisions
Compare sorting algorithms' performance (view source)
Revision as of 01:33, 3 February 2019
, 5 years ago→{{header|Julia}}
Line 1,496:
comparesorts(randomized)
iavg, mavg, qavg = comparesorts(randomized)
println("Average sort times for 40000
println("\tinsertion sort:\t$iavg\n\tmerge sort:\t$mavg\n\tquick sort\t$qavg")
</lang>
Line 1,507:
merge sort: 0.0007967360000000003
quick sort 0.0005601127399999998
Average sort times for 40000
insertion sort: 0.2190664327599999
merge sort: 0.0028818907399999986
| |||