What is the time complexity of this function / algorithm?void f(unsigned int n){ int i; for (i = 1; i < n; i = i * 2) { printf("[%d]\n", i); }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))

Question #20What is the time complexity of this function / algorithm?void f(int n){ int i; int j; for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { printf("[%d] [%d]\n", i, j); } }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #21What is the time complexity of removing at index n from an unsorted Python 3 list?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #22What is the time complexity of accessing the nth element on an unsorted array?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #23What is the time complexity of this function / algorithm?void f(unsigned int n){ int i; for (i = 1; i < n; i = i * 2) { printf("[%d]\n", i); }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #24What is the time complexity of searching for an element in a singly linked list of size n?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #25What is the time complexity of searching for an element in a queue of size n if you are given a pointer to both the head and the tail of the queue?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #26What is the time complexity of accessing the nth element of a singly linked list?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #27What is the time complexity of this function / algorithm?void f(int n){ int i; for (i = 0; i < n; i++) { printf("[%d]\n", i); }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #28What is the time complexity of this function / algorithm?foreach($numbers as $number){ echo $number;}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #29What is the time complexity of searching for an element in a doubly linked list of size n?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #30What is the time complexity of searching for an element - worst case - in a hash table with the implementation you used during the previous Hash Table C project (chaining)?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #31What is the time complexity of this function / algorithm?int Fibonacci(int number){ if (number <= 1) return number; return Fibonacci(number - 2) + Fibonacci(number - 1);}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #32What is the time complexity of searching for an element in an unsorted Python 3 list of size n?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #33What is the time complexity of the “pop” operation onto a stack?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #34What is the time complexity of inserting after the nth element of a singly linked list? (Assuming you have a pointer to the node to insert)O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #35What is the time complexity of this function / algorithm?void f(unsigned int n){ int i; int j; for (i = 0; i < n; i++) { for (j = 1; j < n; j = j * 2) { printf("[%d] [%d]\n", i, j); } }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #36What is the time complexity of searching for an element in an unsorted array of size n?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #37What is the best case time complexity of insertion in a hash table with the implementation you used during the previous Hash Table C project (chaining)?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #38What is the best case time complexity searching for an element in a hash table with the implementation you used during the previous Hash Table C project (chaining)?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #39What is the time complexity of the “push” operation onto a stack?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #40What is the time complexity of this function / algorithm?def func(n): a=5 b=6 c=10 for i in range(n): for j in range(n): x = i * i y = j * j z = i * j for k in range(n): w = a*k + 45 v = b*b d = 33O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #41What is the time complexity of removing at index n in an unsorted array?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #42What is the time complexity of inserting into an unsorted Python 3 list at index n?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Submit answers

What is the time complexity of this function / algorithm?void f(int n){ int i; for (i = 0; i < n; i += 98) { printf("[%d]\n", i); }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))

What is the time complexity of this function / algorithm?void f(int n){ printf("n = %d\n", n);}

Question #0What is the time complexity of this function / algorithm?void f(int n){ printf("n = %d\n", n);}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #1What is the time complexity of “popping” an element in a queue if you are given a pointer to both the head and the tail of the queue?O(1)O(n!)O(n)O(2^n)O(log(n))O(nlog(n))Question #2Assuming you have a pointer to the node to remove, what is the time complexity of removing the nth element of a doubly linked list?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #3Assuming you have a pointer to the node to set the value of, what is the time complexity of setting the value of the nth element in a doubly linked list?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #4What is the time complexity of this function / algorithm?void f(int n){ int i; for (i = 0; i < n; i += 98) { printf("[%d]\n", i); }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #5What is the worst case time complexity of insertion in a hash table with the implementation you used during the previous Hash Table C project (chaining)?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #6What is the time complexity of “pushing” an element into a queue if you are given a pointer to both the head and the tail of the queue?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #7What is the time complexity of removing the nth element of a singly linked list? (Assuming you have a pointer to the node to remove)O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #8What is the time complexity of setting the value of the nth element in a singly linked list? (Assuming you have a pointer to the node to set the value of)O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #9Assuming you have a pointer to the node to insert, what is the time complexity of inserting after the nth element of a doubly linked list?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #10What is the time complexity of setting value at index n in an unsorted Python 3 list?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #11What is the time complexity of this function / algorithm?void f(int n){ int i; int j; for (i = 0; i < n; i++) { if (i % 2 == 0) { for (j = 1; j < n; j = j * 2) { printf("[%d] [%d]\n", i, j); } } else { for (j = 0; j < n; j = j + 2) { printf("[%d] [%d]\n", i, j); } } }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #12What is the time complexity of worst case deletion from a hash table with the implementation you used during the previous Hash Table C project (chaining)?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #13What is the time complexity of inserting at index n on an unsorted array?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #14What is the time complexity of searching for an element in a stack of size n?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #15What is the time complexity of best case deletion from a hash table with the implementation you used during the previous Hash Table C project (chaining)?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #16What is the time complexity of accessing the nth element of a doubly linked list?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #17What is the time complexity of setting a value at index n in an unsorted array?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #18What is the time complexity accessing the nth element in an unsorted Python 3 list?O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #19What is the time complexity of this function / algorithm?var factorial = function(n) { if(n == 0) { return 1 } else { return n * factorial(n - 1); }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))Question #20What is the time complexity of this function / algorithm?void f(int n){ int i; int j; for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { printf("[%d] [%d]\n", i, j); } }}O(n!)O(2^n)O(1)O(n)O(nlog(n))O(n^2)O(log(n))

What is the time complexity of the following code :int i, j, k = 0;for (i = n/2; i <= n; i++) { for (j = 2; j <= n; j = j * 2) { k = k + n/2; }}