1. Least Decisions
I need a sort program that makes the absolute fewest
number of Decisions possible. I intend to sort using
it marking each decision that was made then
reconstruct the original order using the decisions
that where made.
The speed of the sort is not an issue. It may be fast
or it may be slow. It is the number of CONTROLLED
Decisions that need to be as few as possible.
When i said CONTROLLED that means using random
to help the sort speed is not an option.
I thought about bubble sort but Decisions increase
parabolicly. I am not sure how insert sort would
work out but I believe it to have the same result.
PLEASE help.
This is for a compression Idea that I have.
--Lucius Lamar Hilley III
-- e-mail at luciuslhilleyiii at juno.com
-- I can only support file transfers of less than 64K and in UUE format.
