Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Quicksort implementation issue - Java
#15
I can see how that makes sense. Leaving the equal values in both arrays lowers their concentration, which in turn lowers their probability of being picked, and even if they are picked, their effects are lowered due to low concentration. It's quite cool.

This would mean that for arrays of exact duplicates, this implementation would take just as long to run as mine does.
Reply


Messages In This Thread
Quicksort implementation issue - Java - by Russt - 2012-04-29, 06:21 PM
Quicksort implementation issue - Java - by Corn - 2012-05-02, 03:36 PM
Quicksort implementation issue - Java - by nRxUs - 2012-05-04, 01:54 AM
Quicksort implementation issue - Java - by Spaz - 2012-05-04, 07:27 AM
Quicksort implementation issue - Java - by Corn - 2012-05-04, 07:38 AM
Quicksort implementation issue - Java - by Kalovale - 2012-05-04, 06:15 PM
Quicksort implementation issue - Java - by Russt - 2012-05-05, 03:55 AM

Forum Jump:


Users browsing this thread: 1 Guest(s)