data structure

1. ALGORITHM ANALYSIS

Mathematical foundations - Big ‚oh‛ notation– Worst case and best – Tournament method- Finding the largest and second largest – lower bound- Time Space requirements – Knuth Morris Pratt Algorithm - Classical Problems. 

 

1. ALGORITHM ANALYSIS

Mathematical foundations - Big ‚oh‛ notation– Worst case and best – Tournament method- Finding the largest and second largest – lower bound- Time Space requirements – Knuth Morris Pratt Algorithm - Classical Problems.