Trying to understand the 2N lnN compares for quicksort
I was going through the analysis of quicksort in Sedgewick’s Algorithms book. He creates the following recurrence relation for number of compares in quicksort while sorting an array of N distinct items.
Trying to understand the 2N lnN compares for quicksort
I was going through the analysis of quicksort in Sedgewick’s Algorithms book. He creates the following recurrence relation for number of compares in quicksort while sorting an array of N distinct items.
Sorting versus hashing
My problem is as follows. I have an array of n strings with m < n of them distinct. I want to create a one-to-one function which assigns each of the m distinct strings to the numbers 0 ... m-1. For example, if my strings are:
Sorting versus hashing
My problem is as follows. I have an array of n strings with m < n of them distinct. I want to create a one-to-one function which assigns each of the m distinct strings to the numbers 0 ... m-1. For example, if my strings are:
Sorting versus hashing
My problem is as follows. I have an array of n strings with m < n of them distinct. I want to create a one-to-one function which assigns each of the m distinct strings to the numbers 0 ... m-1. For example, if my strings are:
Sort an array in a specific order – not ascending/descending
I’m working on an algorithm that works best if the inputs are passed to it in a particular order, so I want to sort them that way. The difference is drastic enough for me to consider re-sorting the array.
Sort an array in a specific order – not ascending/descending
I’m working on an algorithm that works best if the inputs are passed to it in a particular order, so I want to sort them that way. The difference is drastic enough for me to consider re-sorting the array.
Sort an array in a specific order – not ascending/descending
I’m working on an algorithm that works best if the inputs are passed to it in a particular order, so I want to sort them that way. The difference is drastic enough for me to consider re-sorting the array.
Use ruby’s array sort() method, or add items in correct place with a binary lookup?
If I am loading a whole load of items (un-ordered words from a file or something) would it be more efficient to load them all to a Ruby array, and then use the built in sort! method or to do a binary lookup for the place of each item in the list as I load it, and add it in that position.
Use ruby’s array sort() method, or add items in correct place with a binary lookup?
If I am loading a whole load of items (un-ordered words from a file or something) would it be more efficient to load them all to a Ruby array, and then use the built in sort! method or to do a binary lookup for the place of each item in the list as I load it, and add it in that position.