Which option will be used with sort command to start sorting ofter the nth column of the (m+l)th field?

Why is insertion sort preferred over other sorting algorithms (like selection sort, bubble sort etc.) for Tim sort implementation?

A

Because insertion sort is faster and adaptive

B

Because insertion sort requires less space

C

Because insertion sort is easy to implement

D

Because insertion sort is easy to understand

Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.

A

Both statements are true

B

Statement 2 is true but statement 1 is false

C

Statement 2 is false but statement 1 is true

D

Both statements are false

Why is insertion sort preferred over other sorting algorithms (like selection sort, bubble sort etc.) for introsort implementation?

A

Because insertion sort is faster and adaptive

B

Because insertion sort requires less space

C

Because insertion sort is easy to implement

D

Because insertion sort is easy to understand

Although we ofter use "Speed"and 'Velocity' interchangeably,"Speed" is not always________"Velocity".

A

Alike

B

similar

C

the same as

D

as

Tim sort begins sorting the given array by using which of the following sorting algorithm?

A

selection sort

B

quick sort

C

insertion sort

D

merge sort

Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?

A

Merge sort

B

Shell sort

C

Insertion sort

D

Bubble sort

The length of a rectangular field F is 3 km greater than the side of a square field M , and the width of field F is 3 km less then the side of field M. If the area of field M is m2 square km, what is the area of field F?

A

m2 +6

B

6

C

m2 - 6

D

m2 +9

If nth derivative of xy3 + x2y2 + x3y0 = 0 then order of its nth differential equation is,

A

n

B

n+1

C

n+2

D

n+3

A form sorting machine can sort 12 forms in 10 minutes. How many forms can it sort in one and half hours at this rate ?

A

150

B

158

C

152

D

108

Randomized quick sort is an extension of quicksort where the pivot is chosen randomly. what is the worst case complexity of sorting a numbers using randomized quick sort?

A

O (n)

B

O (n2)

C

O (n log n)

D

O (n!)

Which option will be used with sort command to start sorting ofter the nth column of the (m+l)th field?

Related Questions