[algogeeks] Re: Algorithm for sorting 7 elements

[Nat (Padmanabhan Natarajan)]

I just assumed a reasonable key length and positive numbers. Iterative radix sort using queues should do the job. If you are not happy you can write a linear time algorithm which finds ith max each time and places that in the (7  - i)th position.

On 6/12/06, Mohammad Moghimi <[EMAIL PROTECTED]> wrote:

``Amal P'' talk about number of elements and not about each number's range,
so you cannot use radix or counting sort!

I think selection or insertion sort is the best!

On 6/12/06, Nat (Padmanabhan Natarajan) < [EMAIL PROTECTED] > wrote:

You can use a Radix Sort or Counting sort if you are ready to use an additional array of length 7.

On 6/12/06, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:

Hi,

   I would like to know which is the best algorithm for sorting 7
elements. I have an array which is having 7 columns and many rows. I
want to sort all the columns individualy. So i want to know which is
the algorithm that i have to use for it.

Thanks and regards
Amal P.

--

-- Mohammad
do you C?!!
double m[] = { 9580842103863.650391, 133470973390.236450, 270};
int main(){m[2]--?m[0]*=4,m[1]*=5,main():printf(m);}

Don't attach in Microsoft (.DOC, .PPT) format
http://www.gnu.org/philosophy/no-word-attachments.html

--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---