Question
1. int Max(int a[], int n)
2. {
3. int mi, i;
4. for (mi = 0, i = 0; i < n; i++)
5. if (a[i] > a[mi])
6. mi = i;
7. return mi;
8. }a.
Line 2
b.
Line 4
c.
Line 6
d.
Line 5
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. There is a one line error in the following routine. Find that line.
Similar Questions
Discover Related MCQs
Q. Topological sort can be applied to which of the following graphs?
View solution
Q. Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges)
View solution
Q. Topological sort starts from a node which has?
View solution
Q. What can be the applications of topological sorting?
View solution
Q. Topological sort of a Directed Acyclic graph is?
View solution
Q. Topological sort can be implemented by?
View solution
Q. Topological sort is equivalent to which of the traversals in trees?
View solution
Q. A man wants to go different places in the world. He has listed them down all. But there are some places where he wants to visit before some other places. What application of graph can he use to determine that?
View solution
Q. When the topological sort of a graph is unique?
View solution
Q. What is recurrence for worst case of QuickSort and what is the time complexity in Worst case?
View solution
Q. Which of the following is not a stable sorting algorithm?
View solution
Q. If the number of records to be sorted is small, then sorting can be efficient.
View solution
Q. Suppose we have a O(n) time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using the above algorithm, then use median as pivot. What will be the worst case time complexity of this modified QuickSort.
View solution
Q. Which of the following is not an in-place sorting algorithm?
View solution
Q. The complexity of sorting algorithm measures the as a function of the number n of items to be sorter.
View solution
Q. Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like this:
2 5 1 7 9 12 11 10
Which statement is correct?
View solution
Q. 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?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
