Comments by "Jkauppa" (@Jkauppa) on "Creel" channel.

  1. division is the most advanced comparison operator
    1
  2. it does not only give the order of elements, but the relative location to other elements
    1
  3. thats the basis of the hash sort
    1
  4. radix is too slow, its trash
    1
  5. also talking in peoples hands is a slow way of communicating anything, God gives faster, language does not contain so much
    1
  6. so you imply that solving sorting problem is same as traveling salesman problem of O(n!) complexity
    1
  7. for arbitrary numbers, distributions and scale
    1
  8. omg, radix is the cavemen's version of the distribution sort
    1
  9. so a stone age algorithm
    1
  10. division operator deals with all those passes in one go, duh
    1
  11. you pre-allocate all the linked lists, in an array, so linked list is a structured array
    1
  12. the best problem solving strategy is a problem split into non-intersection stupid smaller sub-problems
    1
  13. hash sort is the most obvious with its steps, optimally just one pass
    1
  14. O(n) guaranteed
    1
  15. seems a magical algorithm
    1
  16. normalized number sorting
    1
  17. so just do the decimal point radix bucket sort (or even binary), divided by digits in order
    1
  18. just 10 buckets for 0-9 or 2 buckets for 0-1
    1
  19. just take the largest digit, not the smallest, more intuitive
    1
  20. you get the largest digit sort order (about) first look with just one pass, ever pass for each digit getting more accurate sort
    1
  21. why would you it non-intuitive inverse order, what a mess
    1
  22. just use the array memory of the original array, or just a copy result output array
    1
  23. k.i.s.s., the "complex" looking stuff can be made efficiently and simple and intuitively
    1
  24. radix sort is same as ray tracing, divide and conquer super parallel
    1
  25. no you dont need any modifications, keep the bucket index content labels
    1