The Artima Developer Community
Articles | News | Weblogs | Books | Forums
Artima Forums | Articles | Weblogs | Java Answers | News
Sponsored Link •

Java Answers Forum
comparing 2 sorting algorithms

0 replies on 1 page.

Welcome Guest
  Sign In

Go back to the topic listing  Back to Topic List Click to reply to this topic  Reply to this Topic Click to search messages in this forum  Search Forum Click for a threaded view of the topic  Threaded View   
Previous Topic   Next Topic
Flat View: This topic has 0 replies on 1 page
edwin mo

Posts: 7
Nickname: ct976
Registered: Oct, 2002

comparing 2 sorting algorithms Posted: Jan 14, 2003 7:29 PM
Reply to this message Reply
Advertisement
hi i am doing a question on comparing 2 sorting algorithms.
there are two algorithms. one is O(nlogn) and the other is O(n^2). it is claimed that when n<100, O(n^2) is actually faster, but when n>100, O(nlogn) is faster.
i expect that O(nlogn) should be faster all the time.. in what case would n^2 would actually be faster??? is there such a thing?

Topic: Vectors again Previous Topic   Next Topic Topic: Swings-jsp-servlets
Sponsored Links


Google
  Web Artima.com   

Copyright © 1996-2019 Artima, Inc. All Rights Reserved. - Privacy Policy - Terms of Use