Insertion sort: Sorting algorithm, Comparison sort, Quicksort, Heapsort, Merge sort, Adaptive sort, Time complexity, Inversion (computer science), ... Bubble sort, Stable sort, In- place algorithm - Brossura

Brossura

ISBN 10: 6130767862 ISBN 13: 9786130767860

Casa editrice: Alphascript Publishing, 2010

Riassunto

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online.Insertion sort is a simple sorting algorithm, a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provides several advantages: simple implementation, efficient for (quite) small data sets, adaptive, i.e. efficient for data sets that are already substantially sorted: the time complexity is O(n + d), where d is the number of inversions, more efficient in practice than most other simple quadratic (i.e. O(n2)) algorithms such as selection sort or bubble sort: the average running time is n2/4[citation needed], and the running time is linear in the best case, stable, i.e. does not change the relative order of elements with equal keys, in-place, i.e. only requires a constant amount O(1) of additional memory space, online, i.e. can sort a list as it receives it. Most humans when sorting—ordering a deck of cards, for example—use a method that is similar to insertion sort.

Dettagli dell'edizione

• Editore: Alphascript Publishing
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 6130767862
• ISBN 13: 9786130767860
• Rilegatura: Copertina flessibile
• Numero di pagine: 120
• Redattore: Miller Frederic P., Vandome Agnes F., McBrewster John
• Contatto del produttore: non disponibile
• Persona responsabile: non disponibile