Asymptotic Analysis

• Algorithm X requires O(N log N) time on O(N processors)

• This ignores constants and lower order terms!

  10N > N log N for N < 1024
  
  10N*N < 1000N log N for N < 996

Previous slide

Next slide

Back to first slide

View graphic version