backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-12 23:15:52 +08:00
Code Issues Projects Releases Wiki Activity

Update binary_insertion_sort.cpp

Browse Source
This commit is contained in:
Siddhartha Shankar Padhy
2021-12-04 12:29:06 +05:30
committed by GitHub
parent e2ab55e4fc
commit 8e983ae9f0
1 changed files with 6 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
sorting/binary_insertion_sort.cpp
View File

@@ -4,7 +4,12 @@
* (Insertion Sort)](https://en.wikipedia.org/wiki/Insertion_sort)
*
* \details
* If the cost of comparisons exceeds the cost of swaps, as is the case for example with * string keys stored by reference or with human interaction (such as choosing one of a pair * displayed side-by-side), then using binary insertion sort may yield better performance. * Binary insertion sort employs a binary search to determine the correct location to insert * new elements, and therefore performs ⌈log2 n⌉ comparisons in the worst case. When each * element in the array is searched for and inserted this is O(n log n).
* If the cost of comparisons exceeds the cost of swaps, as is the case for example with
* string keys stored by reference or with human interaction (such as choosing one of a pair
* displayed side-by-side), then using binary insertion sort may yield better performance.
* Binary insertion sort employs a binary search to determine the correct location to insert
* new elements, and therefore performs ⌈log2 n⌉ comparisons in the worst case.
* When each element in the array is searched for and inserted this is O(n log n).
* The algorithm as a whole still has a running time of O(n2) on average because of the series * of swaps required for each insertion.
* However it has several advantages such as
* 1. Easy to implement