edited by
1,418 views
1 votes
1 votes

Please Justify Statements which are true and which are false by an Example:

Consider the following statements :
S1  :While performing quick sort at any iteration only 1 element can be present at its correct position.
S2  : The running time of Radix Sort is effectively independent of whether the input is already sorted.
S3  : In quick sort, after  iteration applied on the set of elements left after  iterations, if any element is found to be at its correct position, then that element must have been the pivot for the  iteration.
S4 : If a weighted directed graph ‘G’ is known to have no shortest path longer than ‘P’ edges, then it is sufficient to run Bellman-Ford for only ‘P’ passes in order to solve the single source shortest path problem on ‘G’.

Which of the following is correct ?

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
Abhishek Kumar 38 asked Dec 19, 2018
612 views
Which of the following sorting algorithm represented by above code?
0 votes
0 votes
2 answers
4
Somoshree Datta 5 asked Oct 20, 2018
1,587 views
Consider the following scenario during insertion sort when the array looks like the following:{25,75,95,125,80,5,10}The number of comparisons that it will further take fo...