6. Algorithm Intro

How many times is the following cout statement executed within this loop? int counter = 0; for(int k=0; k<5; k++) { cout << "counter: " << counter << endl; }

What is the big O for printing in a linked list.

How long does it take to excute for n items in for loop?

Program execution times are susceptible to the hardware, tricks , data, etc.

for ( int i = 0; i < 4; i++) for( int x = 0; x <3 ; x++) cout << "hi"<< endl; how many times will the cout statement execute?

How many times would the cout operation be done in this loop? for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ for(int k = 0; k < 5; k++){ cout << "o hai.";

How many time is the cout statement executed in the following for loop? int counter = 0; for( int k = 0; k < 5; k++){ cout << "counter: " << counter << endl; }

When measuring algorithm efficiency, the program is susceptible to ____

When you are calculating the number of loops that a nested for loop runs through, you should:

How do you measure the efficiency of algorithms?

What is algorithm analysis measuring?

How many steps does the following take to execute if there's n items in a list? Node* curr = m_head; // 1 assignment while( curr !=NULL) { //n + 1 comparisons cout << curr->next; // n calls to operator<< curr = curr->next; // n assignments } Total: (n + 1) * assignment_time = (n + 1) * comparison_time + n write_time

What is the big O for this segment of code: long factorial(int n){ if(n <= 1) return 1; else return n * factorial(n - 1); }

Program execution times are susceptible to hardware, tricks, data.

How many itterations would a quadruply-nested for loop with base itterations 7 and all others itterating at n itterate?