Rank sort is moving all the elements of an array in ascending order based on their ranks. Less the rank more the left it will be moved towards 0th index. time complexity of rank sort is O(n^2) as no of comparisons in rank sort is (n-1)n/2 + no of movements is 2n. so its almost equal to n^2.

Rank sort is moving all the elements of an array in descending order based on their ranks. Less the rank more the right it will be moved towards last index. time complexity of rank sort is O(n^2) as no of comparisons in rank sort is (n-1)n/2 + no of movements is 2n. so its almost equal to n^2.

Rank sort is moving all the elements of an array in ascending order based on their ranks. Less the rank more the left it will be moved towards 0th index. time complexity of rank sort is O(log n^2) as no of comparisons in rank sort is log (n-1)n/2 + no of movements is 2n. so its almost equal to log n^2.

Rank sort is moving all the elements of an array in descending order based on their ranks. Less the rank more the right it will be moved towards last index. time complexity of rank sort is O(log n^2) as no of comparisons in rank sort is log (n-1)n/2 + no of movements is 2n. so its almost equal to log n^2.

Answer :(A)

Rank sort is moving all the elements of an array in ascending order based on their ranks. Less the rank more the left it will be moved towards 0th index. time complexity of rank sort is O(n^2) as no of comparisons in rank sort is (n-1)n/2 + no of movements is 2n. so its almost equal to n^2.

Description :

Rank sort is moving all the elements of an array in ascending order based on their ranks. Less the rank more the left it will be moved towards 0th index. time complexity of rank sort is O(n^2) as no of comparisons in rank sort is (n-1)n/2 + no of movements is 2n. so its almost equal to n^2.