big-oh Question?

0 ⤊

Algorigthm X must execute big-oh(lg n) time computation a maximum of 16 times for each entry of an n-element array. What is the worst case running time of X?

2006-11-22 00:58:24 · 2 answers · asked by jerez 1 in Science & Mathematics ➔ Mathematics

Please help...

2006-11-22 04:24:27 · update #1

2 answers

No clue

2006-11-22 16:02:03 · answer #1 · answered by v__dawg 3 · 0⤊ 0⤋

16 n O(ln n) which is
n O(ln n) = O(n ln(n)), where O is big-oh...

I think....

2006-11-26 00:11:23 · answer #2 · answered by Theta40 7 · 0⤊ 0⤋