Towards Optimal Sorting of 16 Elements

Details Towards Optimal Sorting of 16 Elements Towards Optimal Sorting of 16 Elements

2011-08-03

arxiv.org/abs/1108.0866v1

Computer Science

Data Structures and Algorithms

10 pages, 7 figures, 2 tables. First submitted to IWOCA 2010, 21st International Workshop on Combinatorial Algorithms. Submiss

Scientific paper

One of the fundamental problem in the theory of sorting is to find the pessimistic number of comparisons sufficient to sort a given number of elements. Currently 16 is the lowest number of elements for which we do not know the exact value. We know that 46 comparisons suffices and that 44 do not. There is an open question if 45 comparisons are sufficient. We present an attempt to resolve that problem by performing an exhaustive computer search. We also present an algorithm for counting linear extensions which substantially speeds up computations.

Affiliated with

Also associated with

No associations

Rating

Towards Optimal Sorting of 16 Elements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Towards Optimal Sorting of 16 Elements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Optimal Sorting of 16 Elements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-664236