Well and truly sorted
-
Hello all, I have created a sorting algorithm that is better than Quick Sort and even competes with Introspective Sort, but is constructed in a much simpler way. I would like people to scrutinise the code, it is rather simple and shouldn't take long to look through. I want to know what people think of it. I have freely released the algorithm for anyone to use and develop further. Please go to the following link to find out more: http://www.geocities.com/nicemadnicemad/software.html Thanks. Chris Nash
Find the simplest proof and you have the ultimate truth.
-
Hello all, I have created a sorting algorithm that is better than Quick Sort and even competes with Introspective Sort, but is constructed in a much simpler way. I would like people to scrutinise the code, it is rather simple and shouldn't take long to look through. I want to know what people think of it. I have freely released the algorithm for anyone to use and develop further. Please go to the following link to find out more: http://www.geocities.com/nicemadnicemad/software.html Thanks. Chris Nash
Find the simplest proof and you have the ultimate truth.
A description of the algorithmm, and what makes it different from quicksort, would be nice (trawling through other peoples C sources isn't exactly a fun thing to do)
Developers, Developers, Developers, Developers, Developers, Developers, Velopers, Develprs, Developers!
We are a big screwed up dysfunctional psychotic happy family - some more screwed up, others more happy, but everybody's psychotic joint venture definition of CP
Linkify!|Fold With Us! -
A description of the algorithmm, and what makes it different from quicksort, would be nice (trawling through other peoples C sources isn't exactly a fun thing to do)
Developers, Developers, Developers, Developers, Developers, Developers, Velopers, Develprs, Developers!
We are a big screwed up dysfunctional psychotic happy family - some more screwed up, others more happy, but everybody's psychotic joint venture definition of CP
Linkify!|Fold With Us!Hi everyone, Please do not worry about looking at my code now. I have had absolutely loads of excellent input and comments from the message boards at these sites: cboard.cprogramming.com www.programmersheaven.com Thank you anyway.
-
Hello all, I have created a sorting algorithm that is better than Quick Sort and even competes with Introspective Sort, but is constructed in a much simpler way. I would like people to scrutinise the code, it is rather simple and shouldn't take long to look through. I want to know what people think of it. I have freely released the algorithm for anyone to use and develop further. Please go to the following link to find out more: http://www.geocities.com/nicemadnicemad/software.html Thanks. Chris Nash
Find the simplest proof and you have the ultimate truth.
intrepid_is wrote:
I have created a sorting algorithm that is better than Quick Sort...
How so?
"Approved Workmen Are Not Ashamed" - 2 Timothy 2:15
"Judge not by the eye but by the heart." - Native American Proverb
-
intrepid_is wrote:
I have created a sorting algorithm that is better than Quick Sort...
How so?
"Approved Workmen Are Not Ashamed" - 2 Timothy 2:15
"Judge not by the eye but by the heart." - Native American Proverb
I looked at it (even though he found "better experts" ha! ;)) As I understand it, he needs knowledge of the smallest and largest value, so he has a better partitioning at quicksort.
Developers, Developers, Developers, Developers, Developers, Developers, Velopers, Develprs, Developers!
We are a big screwed up dysfunctional psychotic happy family - some more screwed up, others more happy, but everybody's psychotic joint venture definition of CP
Linkify!|Fold With Us! -
intrepid_is wrote:
I have created a sorting algorithm that is better than Quick Sort...
How so?
"Approved Workmen Are Not Ashamed" - 2 Timothy 2:15
"Judge not by the eye but by the heart." - Native American Proverb
thanks: https://movied.org
-
I looked at it (even though he found "better experts" ha! ;)) As I understand it, he needs knowledge of the smallest and largest value, so he has a better partitioning at quicksort.
Developers, Developers, Developers, Developers, Developers, Developers, Velopers, Develprs, Developers!
We are a big screwed up dysfunctional psychotic happy family - some more screwed up, others more happy, but everybody's psychotic joint venture definition of CP
Linkify!|Fold With Us!thanks: https://movied.org
-
Hello all, I have created a sorting algorithm that is better than Quick Sort and even competes with Introspective Sort, but is constructed in a much simpler way. I would like people to scrutinise the code, it is rather simple and shouldn't take long to look through. I want to know what people think of it. I have freely released the algorithm for anyone to use and develop further. Please go to the following link to find out more: http://www.geocities.com/nicemadnicemad/software.html Thanks. Chris Nash
Find the simplest proof and you have the ultimate truth.
thanks: https://movied.org
-
A description of the algorithmm, and what makes it different from quicksort, would be nice (trawling through other peoples C sources isn't exactly a fun thing to do)
Developers, Developers, Developers, Developers, Developers, Developers, Velopers, Develprs, Developers!
We are a big screwed up dysfunctional psychotic happy family - some more screwed up, others more happy, but everybody's psychotic joint venture definition of CP
Linkify!|Fold With Us!thanks: https://movied.org
-
Hi everyone, Please do not worry about looking at my code now. I have had absolutely loads of excellent input and comments from the message boards at these sites: cboard.cprogramming.com www.programmersheaven.com Thank you anyway.
thanks: https://movied.org