Find the Operation Count per line of two algorithm to find best cases, worst cases and average cases

first one

second one

Personalized Algorithm Operation Count Of Worst Case Per Line 1 int count = 0; 1 + (N + 1) +N N N for (int i = 0; i 0.5) { int j = count; while(j > 0) { count += N; j- } } ii int count = 0; for (int i = 0; i } == }