What is the tight big-Oh running time of the following code segment? a = 1 i = 1 while i < n a = a * i i = i + 1 endwhile j = i while j > 1 k = 1 while k < m a = a + k -j k = k + 1 endwhile j = j / 2 endwhile Solution algorithm total steps: a = 1 1 i = 1 1 while i < n   n+1 a = a * i n i = i + 1 n endwhile j = i 1 while j > 1 n+1 k = 1 n while k < m m+1 a = a + k -j mn k = k + 1 mn endwhile j = j / 2 n endwhile therefore big oh running time is mn by eliminating all the lower values. we get the runing time by adding all the above terms and neglecting the small values. .

1. What is the tight big-Oh running time of the following code segment?
a = 1
i = 1
while i < n
a = a * i
i = i + 1
endwhile
j = i
while j > 1
k = 1
while k < m
a = a + k -j
k = k + 1
endwhile
j = j / 2
endwhile
Solution
algorithm total steps:

2. a = 1 1
i = 1 1
while i < n   n+1
a = a * i n
i = i + 1 n
endwhile
j = i 1
while j > 1 n+1
k = 1 n
while k < m m+1
a = a + k -j mn
k = k + 1 mn
endwhile
j = j / 2 n
endwhile
therefore big oh running time is mn by eliminating all the lower values. we get the runing time
by adding all the above terms and neglecting the small values.