Time Complexity for Recursive Sorting

• Unit Computational Step:

  Comparing/swapping two numbers.
  

• Problem Size:

  Number of elements to be sorted.
  

• Execution Time:

  Sorting 64 elements takes 64 + 2* (time to sort 32).
  

• Establish Time Complexity Relationship:

  Sorting N elements using merge sort takes
  
  Time Complexity = N*log(N)

Previous slide

Next slide

Back to first slide

View graphic version