Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?

Which recursive sorting technique always makes recursive calls to sort subarrays  that are about half size of the original array?
by

1 Answer

Answer :

Mergesort always makes recursive calls to sort subarrays that are about half size of the  original array, resulting in O(n log n) time.
by

Related questions

Convergense of the estimates is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Convergense of the estimates is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Weighted voting of correction vectors is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Weighted voting of correction vectors is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Adaptive localization at multiple scales is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Adaptive localization at multiple scales is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Weighted voting of correction vectors is a technique of A : Recursive filtering B : FilteringC : Laandmark D : Pose estimation

Description : Weighted voting of correction vectors is a technique of A : Recursive filtering B : FilteringC : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Adaptive localization at multiple scales is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Adaptive localization at multiple scales is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Classification of data points is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Classification of data points is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Convergense of the estimates is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Convergense of the estimates is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Weighted voting of correction vectors is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Weighted voting of correction vectors is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Adaptive localization at multiple scales is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Adaptive localization at multiple scales is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Classification of data points is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Classification of data points is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Convergense of the estimates is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Convergense of the estimates is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Adaptive localization at multiple scales is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Adaptive localization at multiple scales is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Weighted voting of correction vectors is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Weighted voting of correction vectors is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Convergense of the estimates is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Convergense of the estimates is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Weighted voting of correction vectors is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Weighted voting of correction vectors is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Adaptive localization at multiple scales is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Adaptive localization at multiple scales is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Classification of data points is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Classification of data points is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

Classification of data points is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Description : Classification of data points is a technique of A : Recursive filtering B : Filtering C : Laandmark D : Pose estimation

Last Answer : A : Recursive filtering

The sorting out of molecules according to size and shape may be adapted to protein purification in this technique: (A) Adsorption chromatography (B) Gel filtration chromatography (C) Paper chromatography (D) None of these

Description : The sorting out of molecules according to size and shape may be adapted to protein purification in this technique: (A) Adsorption chromatography (B) Gel filtration chromatography (C) Paper chromatography (D) None of these

Last Answer : Answer : B

Suppose that data is an array of 1000 integers. Write a single function call that will sort the 100 elements data [222] through data [321].

Description : Suppose that data is an array of 1000 integers. Write a single function call that will sort the 100 elements data [222] through data [321].

Last Answer : quicksort ((data + 222), 100)

Mark correct option a) Station articles are intended for delivery from a PO to which they are sent b) Sorting articles are articles that are to be sorted by the Poor Mail Office to which they are sent, and fwd to office of final destination or to other sorting offices c) Label bundle are two type express bundle and differed bundle d) Express bundle require to sort immediately & Differed bundle may be disposed later. e) All the above

Description : Mark correct option a) Station articles are intended for delivery from a PO to which they are sent b) Sorting articles are articles that are to be sorted by the Poor Mail Office to which they ... Express bundle require to sort immediately & Differed bundle may be disposed later. e) All the above

Last Answer : e) All the above

Mark correct option a) Sorting sub office are situated near the junction of several mail linesb) Nodal Post office is working in important cities some post office are authorized to receive letters from neighboring PO and sort the mail as per sorting diagram.c) Central bagging unit is branch of RMS office .d) All the above

Description : Mark correct option a) Sorting sub office are situated near the junction of several mail lines b) Nodal Post office is working in important cities some post office are authorized to receive letters from ... per sorting diagram. c) Central bagging unit is branch of RMS office . d) All the above

Last Answer : d) All the above

What are the advantages of activating the automatic Program Global Area (PGA) inSAP system that have an Oracle database? Note: there are 2 correct answered to this question A. Higher system performance is gained B. Shorter response time for queries is achieved C. Large sort processes will use more memory for efficient sorting D. Less PGA memory is allocated in advance

Description : What are the advantages of activating the automatic Program Global Area (PGA) inSAP system that have an Oracle database? Note: there are 2 correct answered to this question A. Higher system ... sort processes will use more memory for efficient sorting D. Less PGA memory is allocated in advance

Last Answer : A. Higher system performance is gained

Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? a) Insertion sort b) Quick sort c) Merge sort d) Selection sort

Description : Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? a) Insertion sort b) Quick sort c) Merge sort d) Selection sort

Last Answer : d) Selection sort

Which of the following sorting algorithm is in-place a) Counting sort b) Radix sort c) Bucket sort d) None

Description : Which of the following sorting algorithm is in-place a) Counting sort b) Radix sort c) Bucket sort d) None

Last Answer : b) Radix sort

Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None

Description : Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general? a) Insertion sort b) Selection sort c) Heap sort d) None

Last Answer : b) Selection sort

Which of the following is not an in-place sorting algorithm? a) Selection sort b) Heap sort c) Quick sort d) Merge sort

Description : Which of the following is not an in-place sorting algorithm? a) Selection sort b) Heap sort c) Quick sort d) Merge sort

Last Answer : merge sort

Which of the following is a stable sorting algorithm? a) Merge sort b) Typical in-place quick sort c) Heap sort d) Selection sort

Description : Which of the following is a stable sorting algorithm? a) Merge sort b) Typical in-place quick sort c) Heap sort d) Selection sort

Last Answer : a) Merge sort

Which of the following is not a stable sorting algorithm? a) Insertion sort b) Selection sort c) Bubble sort d) Merge sort

Description : Which of the following is not a stable sorting algorithm? a) Insertion sort b) Selection sort c) Bubble sort d) Merge sort

Last Answer : b) Selection sort

You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task ? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort

Description : You have to sort a list L, consisting of a sorted list followed by a few ‘random’ elements. Which of the following sorting method would be most suitable for such a task ? (A) Bubble sort (B) Selection sort (C) Quick sort (D) Insertion sort

Last Answer : (D) Insertion sort

How can you sort the elements of the array in descending order?

Description : How can you sort the elements of the array in descending order?

Last Answer : By calling Sort() and then Reverse() methods. 

How can you sort the elements of the array in descending order?

Description : How can you sort the elements of the array in descending order? 

Last Answer : By calling Sort() and then Reverse() methods.

If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Description : If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance? a) Insertion sort b) Selection sort c) Quick sort d) Merge sort

Last Answer : a) Insertion sort

Write a program to sort elements of an array in ascending order.

Description : Write a program to sort elements of an array in ascending order.

Last Answer : #include #include void main() { int a[5],i,j,temp; clrscr(); printf("\n Enter array elements:"); for(i=0;i

Write a program to sort an 1-d array in ascending order.

Description : Write a program to sort an 1-d array in ascending order.

Last Answer : #include<iostream.h> #include<conio.h> void main() { int arr[20]; int i, j, temp,n; clrscr(); cout<<"\n Enter the array size:"; cin>>n; cout<<"\n Enter ... 0;i<n;i++) {  cout<< \n <<arr[i]; } getch(); }

Which technique is used for main memory array design: a. Linear decoding b. Fully decoding c. Both A and B d. None of these

Description : Which technique is used for main memory array design: a. Linear decoding b. Fully decoding c. Both A and B d. None of these

Last Answer : c. Both A and B

When an array is passed as a parameter to a function which of the following statements is correct? (A) The function can change values in the original array. (B) The function cannot change values in the original array. (C) Results in compilation error. (D) Results in runtime error.

Description : When an array is passed as a parameter to a function which of the following statements is correct? (A) The function can change values in the original array. (B) The function cannot change values in the original array. (C) Results in compilation error. (D) Results in runtime error.

Last Answer : (A) The function can change values in the original array.

When an array is passed as parameter to a function, which of the following statements is correct ? (A) The function can change values in the original array. (B) In C, parameters are passed by value, the function cannot change the original value in the array. (C) It results in compilation error when the function tries to access the elements in the array. (D) Results in a run time error when the function tries to access the elements in the array.

Description : When an array is passed as parameter to a function, which of the following statements is correct ? (A) The function can change values in the original array. (B) In C, parameters are passed by value, ... . (D) Results in a run time error when the function tries to access the elements in the array.

Last Answer : (A) The function can change values in the original array.

A fruit and vegetable wholesaler buys truckloads of strawberries from local farmers and then divides them into pint and half-pint baskets to sell to grocery stores. This sorting function is called: A)allocation. B)assorting. C)accumulation. D)sorting out.

Description : A fruit and vegetable wholesaler buys truckloads of strawberries from local farmers and then divides them into pint and half-pint baskets to sell to grocery stores. This sorting function is called: A)allocation. B)assorting. C)accumulation. D)sorting out.

Last Answer : A)allocation.

. Chunori is a dramatic technique featuring an actor suspended in midair and moving over stage and audience. Once done using ropes, it is now executed using steel wires. In what sort of performance would you get to witness Chunori?

Description : . Chunori is a dramatic technique featuring an actor suspended in midair and moving over stage and audience. Once done using ropes, it is now executed using steel wires. In what sort of performance would you get to witness Chunori?

Last Answer : Kabuki

Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Description : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Last Answer : Which of the following algorithm design technique is used in the quick sort algorithm? a) Dynamic programming b) Backtracking c) Divide-and-conquer d) Greedy method

Parcel sorting case must always be kept locked when the work of the Sorting is not going on and the key must remain a) With the HSA b) With the supervisor c) With the parcel sorting assistant d) None of these

Description : Parcel sorting case must always be kept locked when the work of the Sorting is not going on and the key must remain a) With the HSA b) With the supervisor c) With the parcel sorting assistant d) None of these

Last Answer : c) With the parcel sorting assistant

_____ is an antenna with a number of half-wave antenna on it. A. Antenna array B. Tower C. Omni-directional D. Rhombic

Description : _____ is an antenna with a number of half-wave antenna on it. A. Antenna array B. Tower C. Omni-directional D. Rhombic

Last Answer : A. Antenna array

A type of array antenna which consists of one half-wave driven dipole, one reflector and one director A. Hertzian dipole B. Yagi-uda C. Broadside collinear D. Log periodic dipole array

Description : A type of array antenna which consists of one half-wave driven dipole, one reflector and one director A. Hertzian dipole B. Yagi-uda C. Broadside collinear D. Log periodic dipole array

Last Answer : B. Yagi-uda

The arranging of data in a logical sequence is called A) Sorting B) Classifying C) Reproducing D) Summarizing

Description : The arranging of data in a logical sequence is called A) Sorting B) Classifying C) Reproducing D) Summarizing

Last Answer : Answer : A

The process of arranging data in logical sequence is called (1) Classifying (2) Reproducing (3) Summarizing (4) Sorting

Description : The process of arranging data in logical sequence is called (1) Classifying (2) Reproducing (3) Summarizing (4) Sorting

Last Answer : Sorting

What is meant by recursive function ?

Description : What is meant by recursive function ?

Last Answer : Answer : When a function in C program automatically calls itself, that function is called recursive function and this process is called recursive. It is very difficult to understand recursive ... be easily solved by recursive functions. Each recursive function has to have a terminating condition.

What is Difference between recursive and non recursive function?

Description : What is Difference between recursive and non recursive function?

Last Answer : A non-recursive function is simply an ordinary function. A recursive function only differs from an ordinary function in that it calls itself at some point.Recursive functions are often used to implement naturally recursive algorithms. For ... = 1 * 2 * 3 * ... * n):unsigned f (unsigned n) {if (n

What is Difference between recursive and non recursive function?

Description : What is Difference between recursive and non recursive function?

Last Answer : A non-recursive function is simply an ordinary function. A recursive function only differs from an ordinary function in that it calls itself at some point.Recursive functions are often used to implement naturally recursive algorithms. For ... = 1 * 2 * 3 * ... * n):unsigned f (unsigned n) {if (n

What is meant by recursive hints ?

Description : What is meant by recursive hints ?

Last Answer : Number of times processes repeatedly query the dictionary table is called recursive hints. It is due to the data dictionary cache is too small. By increasing the SHARED_POOL_SIZE parameter we can optimize the size of Data Dictionary Cache.