Friday
September 4, 2015

Homework Help: Computer Science

Posted by Elizabeth on Monday, October 12, 2009 at 1:32pm.

I am learning in my computer science class about algorithms. My teacher wrote on the board:

n= 1 running time= 1
3 1+1= 2
7 1+2= 3
15 1+3= 4
31 1+4=5
63 1+5= 6
127 7
255 8
511 9
1023 10

How in the world does this happen?

It has something to do with log n steps. I don't understand this concept.

What does it mean log n= <<n for large n?

Also, what is O(n)?

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

More Related Questions

Members