|
-
Sep 2nd, 2005, 09:07 AM
#11
transcendental analytic
Re: Sorting small arrays. Witch algo is fastest.
 Originally Posted by NoteMe
Grrr...give me a break here.. 
I'll try to remember it this time..  ..it is a linux command too, and I always have to try 3-4 times before I manage to write it right...
Unless you have me reminding you about all the time, nobody knows what sort of schwahili your english is transmutating into 
What do you mean by indexes relatively close? I have never read up on Radix or bucket sort. Just heard about them. So no idea how they will affect this.
That they are about a certain distance from each other. Radix sort and bucket sort only works if you sort things within certain limits. Anyway I guess it might be best to either run shellsort or just raw insertion sort, which I think after hearing what you use it for might be best.
BTW there where some artifacts on the picture. I have too look into what went wrong.
- ØØ -
can you post a screenshot?
Use  
writing software in C++ is like driving rivets into steel beam with a toothpick.
writing haskell makes your life easier:
reverse (p (6*9)) where p x|x==0=""|True=chr (48+z): p y where (y,z)=divMod x 13
To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|
Reply With Quote