EGEL Plus Ingeniería Computacional

CENEVAL EGEL Plus Ingeniería Computacional (EGEL Plus ICOMPU)

Desarrollo De SoftwareEnglish
Exam overview

Practice session

Analyze the following algorithm snippet: for (int i = 0; i < n; i++) { for (int j = 1; j < n; j = j * 2) { // constant time operation O(1) } } What is the asymptotic worst-case time complexity in Big-O notation as a function of n?

Loading your practice session…