Oh yes. I've tested several versions of quicksort, against several
other algo's. Once Quicksort was tuned, nothing matched it for a
general purpose sorter of large N.
If you read through my post, I showed the example on an array of what I
was talking about with distribution sorting. Since it actu
Hi all,I faced this problem in my lab exam.I wonder if there could be any other method than brute force(for finding out no.s to be swapped) is possible.We've all seen magic squares before. They are square grids full of numbers arranged so that the rows, columns and diagonals all have the same sum:
adak wrote:
> With all caveats to the "different sorts work best in different
> situations/data", posts above, the bare-assed fact of the matter is
> that quicksort, WHEN SET UP PROPERLY for the data, will beat any other
> general purpose sorting algorithim for anything other than trivial
> number
What I'd like to see you do to answer this, is set up a Monte Carlo
simulation program. Have it play 10,000 games with each possible answer
to the flip or keep, question. All from random draws.
Now compare their scores, and tell us who won. Did it match your
expectations, or not?
Adak
--~--~--
With all caveats to the "different sorts work best in different
situations/data", posts above, the bare-assed fact of the matter is
that quicksort, WHEN SET UP PROPERLY for the data, will beat any other
general purpose sorting algorithim for anything other than trivial
numbers.
The real problem w
Hello,
Resourceful Link for Programming !
http://get-best.com/IT_Interview_Questions/programming.htm
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to
