Which of the following is not a stable sorting algorithm?

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

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

A

selection sort

B

quick sort

C

insertion sort

D

heap sort

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 is not a stable sorting algorithm in its typical implementation?

A

Insertion sort

B

Merge sort

C

Quick sort

D

Bubble sort

Which of the following sorting algorithm is NOT stable?

A

Introsort

B

Brick sort

C

Bubble sort

D

Merge sort

Which of the following sorting algorithm is not stable __________

A

insertion sort

B

bubble sort

C

merge sort

D

bogosort

Which of the following statement is not a stable sorting algorithm?

A

LSD radix sort

B

MSD radix sort

C

Counting sort

D

Pigeonhole sort

Which of the following is not necessarily a stable sorting algorithm?

A

bucket sort

B

counting sort

C

merge sort

D

pigeonhole sort

The transfer function of a discrete time LTI system is given by
$$H\left( z \right) = {{2 - {3 \over 4}{z^{ - 1}}} \over {1 - {3 \over 4}{z^{ - 1}} + {1 \over 8}{z^{ - 2}}}}$$
Consider the following statements:
S₁ : The system is stable and causal for
$$ROC:\left| z \right| > {1 \over 2}$$
S₂ : The system is stable but not causal for
$$ROC:\left| z \right| S₃ : The system is neither stable nor causal for
$$ROC:{1 \over 4} Which one of the following statements is valid?

A

Both S₁ and S₂ are true

B

Both S₂ and S₃ true

C

Both S₁ and S₃ are true

D

S₁, S₂ and S₃ are all true

Which of the following sorting algorithm is stable?

A

Introsort

B

Tim sort

C

Heap sort

D

Quick sort

Which of the following is not a stable sorting algorithm?

Related Questions