can you elaborate the sorting networks problem? because I did elaborate a sorting algorithm which is somehow similar to the graphic you are showing in the video.
Sorting networks are a kind of fixed sorting algorithm where the particular elements that get compared (and then possibly swapped) and the order in which those compare-swap operations take place, don't depend at all on the results of earlier operations. They can be built as circuits for sorting a fixed number of values. Some are optimized for speed, others for number of components. Some of most efficient SN's were evolved, not designed.
Cool, now I know there is a sorting theory where I can fit my sorting algorithm because it's exactly what my algorithm is. I did manage to create a sorting algo which uses full advantage of multi-core cpu and with N-1 comp-swap (which gives O(N-1)) if there is half cpu core than data to sort, otherwise it gives with 1 cpu O(N.log(N)). Unfortunately, I can't publish my algo to a scientific format because I didn't do the math and tests to prove it.
You could write an N-processor simulation for your algorithm and see how long it takes (in simulated time).
How many comp-swap operations would there be if you had only 16 values to sort? If you can find a way to do it with less than 60 you'll break the current efficiency record. I got obsessed a few years ago trying to break that record with a GA. Never succeeded. Maybe I'll fire up the code again and give it another go someday.
You are Darwin = Awesomeness to ∞ :)
Octostatue 2 years ago
Man, do i envy you!
I have a 2y old kid. He plays with GeenPool (Swimbots). I envy him too (i ate dirt at his age).
I'll make sure he learns biology and programming. Your area of research is probably the most important (yeah, THE most).
It's too late for me. I'm a lawyer.
Perhaps the only contribution i can make is to interest my son in these things.
lardhat 3 years ago
Sorry for the slow reply! Thanks for the kind words. I had a good chuckle over the "it's too late for me. I'm a lawyer" line X-D
kjlg74 3 years ago
Hey I guess we are both Darwin. ;D
TheReasonWhyGuy 3 years ago
YOU are full of awesome :D
labrat882 3 years ago
Thanks!
kjlg74 3 years ago
pretty epic... sounds like a commercial for a convention of evolutionary stuff.
keysle 3 years ago
Thanks!
kjlg74 3 years ago
can you elaborate the sorting networks problem? because I did elaborate a sorting algorithm which is somehow similar to the graphic you are showing in the video.
newcoleco 3 years ago
Sorting networks are a kind of fixed sorting algorithm where the particular elements that get compared (and then possibly swapped) and the order in which those compare-swap operations take place, don't depend at all on the results of earlier operations. They can be built as circuits for sorting a fixed number of values. Some are optimized for speed, others for number of components. Some of most efficient SN's were evolved, not designed.
kjlg74 3 years ago
Cool, now I know there is a sorting theory where I can fit my sorting algorithm because it's exactly what my algorithm is. I did manage to create a sorting algo which uses full advantage of multi-core cpu and with N-1 comp-swap (which gives O(N-1)) if there is half cpu core than data to sort, otherwise it gives with 1 cpu O(N.log(N)). Unfortunately, I can't publish my algo to a scientific format because I didn't do the math and tests to prove it.
newcoleco 3 years ago
You could write an N-processor simulation for your algorithm and see how long it takes (in simulated time).
How many comp-swap operations would there be if you had only 16 values to sort? If you can find a way to do it with less than 60 you'll break the current efficiency record. I got obsessed a few years ago trying to break that record with a GA. Never succeeded. Maybe I'll fire up the code again and give it another go someday.
kjlg74 3 years ago
cool vid.
The creature at 1:28 is awesome!
I've never seen that one before.
inthefade 3 years ago
That's one of my favorites, the "walking necklace". It's #122 on the zoo gallery. The youtube video ID for it is QPEjzxjxXoM
kjlg74 3 years ago