Yes ... @pavel
Gurkov you are very correct . Becoz every algorithm is having some time and space complexity.
As per my knowledge quick sort and merge sort both are very time efficient than any sorting algo. With the time complexity of O(nlogn) . while the other sorting algo. like selection sort, insertion sort and bubble sort takes O(n²) time.
Here n is the number of items.
You can find the code for above sorting algo. in below repo that I have prepared. github.com/AjayNeman45/Sorting-Algo
Thank you for your reply Ajay,
but you kinda got me wrong.
I was trying to point out that the contents of the article are incomplete; pros and cons are just statements without any proof and some of them are, actually, wrong.
Given that the article has 69 bookmarks, it worries me.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Yes ... @pavel Gurkov you are very correct . Becoz every algorithm is having some time and space complexity.
As per my knowledge quick sort and merge sort both are very time efficient than any sorting algo. With the time complexity of O(nlogn) . while the other sorting algo. like selection sort, insertion sort and bubble sort takes O(n²) time.
Here n is the number of items.
You can find the code for above sorting algo. in below repo that I have prepared.
github.com/AjayNeman45/Sorting-Algo
Thank you for your reply Ajay,
but you kinda got me wrong.
I was trying to point out that the contents of the article are incomplete; pros and cons are just statements without any proof and some of them are, actually, wrong.
Given that the article has 69 bookmarks, it worries me.