UGC NET CS 2013 Sep-paper-2
October 8, 2024Data-Interpretation
October 9, 2024KVS 22-12-2018 Part-B
| Question 1 |
Which of the following algorithms use recursion for sorting an array of integers?
| Bubble sort and Insertion sort | |
| Bubble sort and Quicksort | |
| Bubble sort and merge sort | |
| Quicksort and merge sort |
Question 1 Explanation:
Recursion is used in quicksort and merge sort.
The quick sort and merge sort algorithms are based on the divide and conquer algorithm which works in the quite similar way.
In the both algorithm, the larger problem is divided into smaller one until you find the solution later we will combine all smaller solutions into final solution.
The quick sort and merge sort algorithms are based on the divide and conquer algorithm which works in the quite similar way.
In the both algorithm, the larger problem is divided into smaller one until you find the solution later we will combine all smaller solutions into final solution.
Correct Answer: D
Question 1 Explanation:
Recursion is used in quicksort and merge sort.
The quick sort and merge sort algorithms are based on the divide and conquer algorithm which works in the quite similar way.
In the both algorithm, the larger problem is divided into smaller one until you find the solution later we will combine all smaller solutions into final solution.
The quick sort and merge sort algorithms are based on the divide and conquer algorithm which works in the quite similar way.
In the both algorithm, the larger problem is divided into smaller one until you find the solution later we will combine all smaller solutions into final solution.
Subscribe
Login
0 Comments