Comments by "Jkauppa" (@Jkauppa) on "Why is Radix Sort so Fast? Part 1 Why are Comparison Sorts so Slow?" video.

  1. radix is too slow, must be faster! :) Hash sort
    1
  2. Hash sort beats even radix sort
    1
  3. it does not use comparisons but division
    1
  4. division is the most advanced comparison operator
    1
  5. it does not only give the order of elements, but the relative location to other elements
    1
  6. thats the basis of the hash sort
    1
  7. radix is too slow, its trash
    1
  8. also talking in peoples hands is a slow way of communicating anything, God gives faster, language does not contain so much
    1
  9. so you imply that solving sorting problem is same as traveling salesman problem of O(n!) complexity
    1