Question:medium

Match the following algorithms with their worst-case time complexities.

Show Hint

Remember the standard worst-case complexities: \[ \text{Linear Search} = O(n) \] \[ \text{Binary Search} = O(\log n) \] \[ \text{Selection Sort} = O(n^2) \] These are among the most frequently asked complexities in competitive exams and interviews.

Updated On: Jun 25, 2026

A-III, B-II, C-I
A-II, B-III, C-I
A-I, B-II, C-III
A-I, B-III, C-II

Show Solution

The Correct Option is B

Solution and Explanation

Was this answer helpful?

Questions Asked in TS PGECET exam

The Eigenvalues of \(3\times 3\) real matrix A are 1, 2, 3 then \(A^{-1} =\)

TS PGECET - 2026
Linear Algebra

View Solution

Let \(A=\begin{bmatrix} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 0 & 0 & 1 \end{bmatrix}\). If \(u_1\) and \(u_2\) are column matrices such that \(Au_1 = \begin{bmatrix} 2 \\ 1 \\ 0 \end{bmatrix}\) and \(Au_2 = \begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix}\), then \(u_1 - u_2\) is

TS PGECET - 2026
Matrices

View Solution

Let \(a,b\) and \(c\) be real numbers. Suppose there exist real numbers \(x,y,z\) which are not all zero such that the system of equations \(x = cy + bz\), \(y = cx + az\) and \(z = bx + ay\) has a non-zero solution then \(\left(a+b+c\right)^2 =\)

TS PGECET - 2026
Determinants

View Solution

For the function \(f(x)=\log x\), the number \(c\) strictly between \(e^2\) and \(e^3\) that satisfies \(f'(c)=\dfrac{f(e^3)-f(e^2)}{e^3-e^2}\) is

TS PGECET - 2026
Calculus

View Solution

Match the following algorithms with their worst-case time complexities.

Show Hint

The Correct Option is B

Solution and Explanation

Top Questions on Computer Languages and Algorithms

Questions Asked in TS PGECET exam