4 Kicks

How to break quicksort (igoro.com)

submitted by igoroigoro(800) 1 year, 9 months ago

Quicksort usually runs in O(N log N) time, but in special cases, it takes much longer: O(N^2). It is surprisingly easy to force any quicksort implementation to degrade into the quadratic-time behavior. This trick even works against a randomized quicksort! The article demonstrates how the trick works by applying it against the BCL Array.Sort() routine.

add a comment | category: | Views: 7

tags: another

new Add a live kick counter to your blog >> liveImage

You can even customize the image by choosing your own colors, and then clicking the button below to update the preview and the html code:

  • "Kick It" text
  • "Kick It" background
  • kick count text
  • kick count background
  • border

Simply copy and paste this HTML into your blog post.


Users who kicked this story:
tiernanotiernano(1560) - mdoppmdopp(850) - yesthatmcgurkyesthatmcgurk(3805) - igoroigoro(800)

Comments:

No comments so far

information Login or create an account to comment on this story
View upcoming stories
Submit a story
How else can I help?
Add our feeds to your site

Most Active Users