Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following pair of sorting algorithms are stable?

Which of the following pair of sorting algorithms are stable? Correct Answer gnome sort and merge sort

Gnome sort and merge sort are stable sorting algorithms as the elements with identical values appear in the same order in the output array as they were in the input array when any of these sorting algorithms are implemented.

Related Questions

Given below are some famous algorithms and some algorithm design paradigms Algorithms Design Paradigm  1. Dijkstra's shortest path algorithms  (a) Greedy design  2. Floyd-Warshall's all-pair-shortest path algorithms  (b) Divide and conquer  3. Kruskal's minimum spanning tree algorithm  (c) Dynamic programming  4. Merge Sort algorithm     Which of the following correspondence is correct?
Which of the following statements are correct? 1. The pair (AB) is controllable implies that the pair (ATBT) is observable. 2. The pair (AB) is controllable implies that the pair (ATBT) is unobservable. 3. The pair (AC) is observable implies that the pair (ATCT) is controllable. 4. The pair (AC) is observable implies that the pair (ATCT) is uncontrollable. where: A, B and C are having their standard meanings
Abhishek ordered 6 pair of red shoes and some pair of books. The price of a pair of red shoes is double than that of a pair of book. While preparing the bill the shopkeeper interchanged the number of pair of shoes and books by mistake which increased the bill by 40%. What was the ratio of the number of pair of red shoes and the number of pair of books in the original order?
Which of the following sorting algorithms is the fastest for sorting small arrays?
Cryptographic algorithms are based on mathematical algorithms where these algorithms use ___________ for a secure transformation of data.
Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
A leading shoe manufacturer produces a pair of Lebron James signature shoes at a labor cost of P 900.00 a pair and a material cost of P 800.00 a pair. The fixed charges on the business are P 5,000,000 a month and the variable costs are P 400.00 a pair. Royalty to Lebron James is P 1,000 per pair of shoes sold. If the shoes sell at P 5,000 a pair, how many pairs must be produced each month for the manufacturer to break-even?
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:
S1 : The system is stable and causal for
$$ROC:\left| z \right| > {1 \over 2}$$
S2 : The system is stable but not causal for
$$ROC:\left| z \right| S3 : The system is neither stable nor causal for
$$ROC:{1 \over 4} Which one of the following statements is valid?
In a class text, to the question, find out 23% of 200, two students answered in following ways:  Student A: 23% of 200 = 23% of (100 + 100) = 23 + 23 = (20 + 20) + (3 + 3) = 46  Student B: 23% of 200 = 200 × \(\frac{23}{100}\) = 2 × 23 = 46 Which of the following statements is the most appropriate in the given context? 1. Since student B has used the standard algorithm, teacher gives full marks to student B and zero to student A 2. Teacher gives full marks to both the students as they have attempted the question using their own algorithms. Both formal and informal algorithms are integral to solving problems in mathematics. 3. Teacher gives zero marks to student A and directs him to redo the question using the algorithm taught in the Class 4. Teacher accepts both the responses but directed student A to refrain from using informal algorithm 
Which of the following statements are true ? (A) A sentence α entails another sentence β  if β is true in few worlds where α is true. (B) Forward chaining and backward chaining are very natural reasoning algorithms for knowledge bases in Horn form. (C) Sound inference algorithms derive all sentences that are entailed. (D) Propositional logic does not scale to environments of unbounded size. Choose the correct answer from the options given below: