From: Jason Lillywhite Date: 2009-10-13T11:46:55+09:00 Subject: Re: manually sort array of numbers Josh Cheek wrote: > First of all, the time complexity of your sort is O(n^2) while the built > in > sort's time complexity is O(n lg n) Wow. That is interesting. Thank you for sharing. I really just want to learn how to sort something on my own before using the Array#sort method. I learned to write this function in my intro to Java class at school. What does the zero in "O(n^2)" mean and how did you figure that out? Thanks again. -- Posted via http://www.ruby-forum.com/.