asked on

Difference / order nlog(n) VS. n^2 algorithm.

What is the difference between an order nlog(n) and n^2 algorithm. Please give a detailed explanation and examples of each in VB5. I believe this relates to asymtotic boundaries and sorting heaps and such, but need a definitive answer that an MIS dude can understand. Email to me if you have the time:

jhowell@cyberhighway.net

Thanks!!!

a111a111a111

Private Sub Form_Load()
MsgBox 10 ^ 2 '>> it is like 10 times 10
MsgBox 10 * Log(10) ' >> it is like 10 times log(base 10)of 10
End
End Sub

jwhowell

ASKER

a111a111a111,

Thank you for the math lesson on natural logrithms, but I was hoping for a a bit more. This relates to sorting algorithms and I need examples of each equation where I can generate a large random array or something and time the sorting of each algorithm based on the volume of the sort. Do you have any code for timing sorting like I describe?

jwhowell

ASKER CERTIFIED SOLUTION

steve06

membership

This solution is only available to members.

To access this solution, you must be a member of Experts Exchange.

Start Free Trial

jwhowell

ASKER

Steve06,

You are the man! Thanks a bunch. I may want to Email you about the small comparison app I'll build using your algorithms. Could you send me your Email address? I also ordered a book called 'Ready-To-Run Visual Basic Algorithms.' Do you know this book?

Here are the points!

Jason W. Howell

steve06

Jason,

I don't know the book you mention. May be it contains sort algorithms as well.

I am happy that I could answer your question. My e-mail is
steve06@infonie.be

Steve.