Time Complexity of Sortings

 Time Complexity of  Sorting Algorithm....

 

  •  Bubble Sort 
  • Selection Sort 
  • Insertion Sort 
these above have time complexity of order  = O(n*n).
  •  Merge sort
  • Quick sort
these have the time complexity of order = O(n(logn)).
  •  count sort
this has the time complexity of order = O(n). 
 
πŸ’₯ Note :
 
πŸ‘‰Time Complexity of order O(n) is called Best  case.
πŸ‘‰ Time Complexity of order O(n(logn) is called Average  case.
πŸ‘‰Time Complexity of order O(n*n) is called Worst  case.
 

Comments

Popular posts from this blog

Computer Viruses

Handwritten Digits Recognition using Machine Learning