gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Added algorithmic paradigm (#18416)

Browse Source
This commit is contained in:
pnjha
2018-10-14 21:50:04 +05:30
committed by Quincy Larson
parent ce92f504d9
commit 1faba7d811
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
client/src/pages/guide/english/algorithms/sorting-algorithms/index.md
View File

@ -51,3 +51,5 @@ Sorting algorithms are said to be `in place` if they require a constant `O(1)` e
### Best possible time complexity for any comparison based sorting ### Best possible time complexity for any comparison based sorting
Any comparison based sorting algorithm must make at least nLog2n comparisons to sort the input array, and Heapsort and merge sort are asymptotically optimal comparison sorts.This can be easily proved by drawing the desicion tree diagram. Any comparison based sorting algorithm must make at least nLog2n comparisons to sort the input array, and Heapsort and merge sort are asymptotically optimal comparison sorts.This can be easily proved by drawing the desicion tree diagram.
### Algorithmic Paradigm
Merge Sort and Quick Sort are based on Divide and Conquer Algorithm