Give the time complexity of merge sort, insertion sort in the worst case, and accessing an element of an array by its index.

Why are constants and lower-order terms dropped from a big O expression?

State the time complexity of the following and justify it: for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) sum++;

What does big O notation measure, and give the complexity of linear search, binary search and bubble sort.

Write a recursive Java method to compute the factorial of a non-negative integer n.

State and verify the absorption law X + X·Y = X using a truth table.

Convert the Boolean expression F(A, B, C) = Σ(1, 3, 5) into its canonical sum of products form.