Algorithms | Sorting | The Inquisitive

Algorithms - Sorting

page 1 out of 5

page 1 out of 5

Question 1

What is the best time complexity of bubble sort Algorithm?

A

B

C

D

Question 2

What is the third pass for this array elements for Bubble sort? Array = {7, 2, 5, 66, 22, 34}

A

[2, 5, 7, 22, 34, 66]

B

[2, 7, 5, 66, 22, 34]

C

[7, 2, 5, 66, 22, 34]

D

[2, 5, 7, 22, 34, 66]

Question 3

For following scenario which algorithm is best suitable? Scenario: large files based on small keys

A

B

C

D

None of the above

Question 4

For selection sort Average, Best and worst complexities are same i.e O(n*n)

A

B

Question 5

Pivot in quick sort can be

A

B

C

D

E

Any of the above

Question 6

What is the time complexity in worst case for Insertion sort?

A

B

C

D

Question 7

What is the bestcase time complexity for insertion sort? A. C.

A

B

C

D

Question 8

Insertion sort is an In-place Algorithm

A

B

Question 9

Maximum number of passes of array length N, in insertion sort algorithm?

A

B

C

D

Question 10

Following snippet is resembles which algorithm?

Function(A)
{
	for (j=2 ; j<A.length();j++)
	{
 		Key = A[j]
		I = j-1
		While ( i>0 and A[i]>key)
		 {
			A[i+1] = A[i]
			I = i-1
		}
		A[i+1] = key

}

A

B

C

D

None of the above

page 1 out of 5

page 1 out of 5

Sign Up Page

Sign In Sign Up

Forgot Password

{{ nameValue }}

{{ emailValue }}

{{ passValue }}

{{ confValue }}

Password must be strong.Eg:@TheInquisitive123

Oops!!

To view the solution need to Login

Score : 0 / 0

L

o

a

d

i

n

g

.

.

.