Tag Archives: Analyze the following pseudo code containing nested loops by computing its worst-case running time complexity.

CS502 Fundamentals of Algorithms Assignment 1 Solution Spring 2013

Question: 1 Analyze the following pseudo code containing nested loops by computing its worst-case running time complexity. Perform all the steps by writing out the loops as summations and then solve the summations. for  i = 1    to   log n {          set   j = 1 ;       // ignore its constant time in analysis              while ( j […]