eggy/highschool
1
0
Fork 0
mirror of https://gitlab.com/magicalsoup/Highschool.git synced 2025-01-23 16:11:46 -05:00
Code Issues Releases Wiki Activity

Update Insertion Sort.md

Browse Source
This commit is contained in:
James Su 2019-11-06 17:02:12 +00:00
parent bee1e0a88b
commit 51716bd088
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Grade 10/Computer Science/ICS4U1/Sorting Methods/Insertion Sort.md
View File

@ -66,7 +66,7 @@ Number of passes and comparisons
- Insetion sort always require n-1 passes - Insetion sort always require n-1 passes
- Mininimum number of comparisons = $`n-1`$ - Mininimum number of comparisons = $`n-1`$
- maximum number of comparisons = $`\dfrac{n^2-n}{2}`$ or $`n(n-1)/2`$ - maximum number of comparisons = $`\dfrac{n^2-n}{2}`$ or $`n(n-1)/2`$
- Average number of comparisons = $`\dfrac{n^2-n}{4}`$ or $n(n-1)/4`$ - Average number of comparisons = $`\dfrac{n^2-n}{4}`$ or $`n(n-1)/4`$
## When To Use ## When To Use
- Good to use when the array is `nearly sorted`, and only a few elements are misplaced - Good to use when the array is `nearly sorted`, and only a few elements are misplaced