Library Sort Sagi Arsyad http://geeks.netindonesia.net/blogs/sagiarsyad/ sagia@live.com
Library Sort Merupakan variasi dari Insertion Sort Pada Temporary Sorted Array, pada elemennya diberi jarak Jarak antar elemennya dimaksudkan untuk mengurangi proses pergeseran pada saat Insertion Cost nya O(n log n)
Insertion Sort 8 5 3 7 4 2 6 1
Insertion Sort 5 8 3 7 4 2 6 1
Insertion Sort 2 3 4 5 6 7 8 1
Library Sort 8 5 3 7 4 2 6 1 array A : 8 Array S : (1+ ε)* n (1+ ε)* 8 = 24 Insertion Limit (1 + ε)2i
Library Sort 8 8 5 3 7 4 2 6 1
Library Sort 8 5 3 7 4 2 6 1 8 Insertion Limit (1 + 3)21 = 6
Library Sort 8 5 5 3 7 4 2 6 1 8
Library Sort 8 5 3 7 4 2 6 1 5 8
Library Sort 8 5 3 3 7 7 4 2 6 1 5 8
Library Sort 8 5 3 7 4 2 6 1 3 5 7 8
Library Sort 8 5 3 7 4 2 6 1 3 5 7 8
Library Sort 8 5 3 7 4 4 2 6 1 3 5 7 8
Library Sort 8 5 3 7 4 2 2 6 6 1 1 3 4 5 7 8
Library Sort 8 5 3 7 4 2 6 1 1 2 3 4 5 6 7 8
Library Sort 1 2 3 4 5 6 7 8
Resource http://www.cs.sunysb.edu/~bender/pub/TOCS06-librarysort.pdf http://sagiarsyad.com/upload/LibrarySort.cs http://homepages.ihug.co.nz/~aurora76/Malc/Sorting_Array.htm