backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-04 07:13:18 +08:00
Code Issues Projects Releases Wiki Activity

small case 'e'

Browse Source 
Co-authored-by: Ayaan Khan <ayaankhan98@gmail.com>
This commit is contained in:
Krishna Vedala
2020-07-01 13:04:54 -04:00
committed by GitHub
parent fed7dd1c13
commit 84fd1cb0d0
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
sorting/insertion_sort.cpp
View File

@@ -9,7 +9,7 @@
* sorted array one at a time. It is much less efficient compared to * sorted array one at a time. It is much less efficient compared to
* other sorting algorithms like heap sort, merge sort or quick sort. * other sorting algorithms like heap sort, merge sort or quick sort.
* However it has several advantages such as * However it has several advantages such as
* 1. easy to implement * 1. Easy to implement
* 2. For small set of data it is quite efficient * 2. For small set of data it is quite efficient
* 3. More efficient that other Quadratic complexity algorithms like * 3. More efficient that other Quadratic complexity algorithms like
* Selection sort or bubble sort. * Selection sort or bubble sort.