Question
a)
for(int j=arr.length-1; j>=0; j--)
{
for(int k=0; k<j; k++)
{
if(arr[k] > arr[k+1])
{
int temp = arr[k];
arr[k] = arr[k+1];
arr[k+1] = temp;
}
}
}
b)
for(int j=arr.length-1; j>=0; j--)
{
for(int k=0; k<j; k++)
{
if(arr[k] < arr[k+1])
{
int temp = arr[k];
arr[k] = arr[k+1];
arr[k+1] = temp;
}
}
}
c)
for(int j=arr.length; j>=0; j--)
{
for(int k=0; k<j; k++)
{
if(arr[k] > arr[k+1])
{
int temp = arr[k];
arr[k] = arr[k+1];
arr[k+1] = temp;
}
}
}
d) None of the mentioneda.
a
b.
b
c.
c
d.
d
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. Select the appropriate code that performs bubble sort.
Similar Questions
Discover Related MCQs
Q. What is the average case complexity of bubble sort?
View solution
Q. What is the advantage of bubble sort over other sorting techniques?
View solution
Q. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?
View solution
Q. What is the best case efficiency of bubble sort in the improvised version?
View solution
Q. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?
View solution
Q. QuickSort can be categorized into which of the following?
View solution
Q. What is the worst case complexity of QuickSort?
View solution
Q. What is a randomized QuickSort?
View solution
Q. What is the best case complexity of QuickSort?
View solution
Q. The given array is arr = {2,3,4,1,6}. What are the pivots that are returned as a result of subsequent partitioning?
View solution
Q. What is the average case complexity of QuickSort?
View solution
Q. The given array is arr = {2,6,1}. What are the pivots that are returned as a result of subsequent partitioning?
View solution
Q. Which of the following is not true about QuickSort?
View solution
Q. What is the time complexity for a given pancake sort given it undergoes “n” flip operations?
View solution
Q. Which operation is most essential to the process of pancake sort?
View solution
Q. How many flips does the simplest of pancake sorting techniques require?
View solution
Q. Pancake Sorting appears in which of the following?
View solution
Q. In addition to the pancake sorting problem, there is the case of the burnt pancake problem in which we are dealing with pancakes (discs) that are burnt on one side only. In this case it is taken that the burnt side must always end up _______
View solution
Q. In a computational complexity theory, a problem with decision making is said to be NP-complete when it is both in NP and NP-hard. What does NP mean?
View solution
Q. When we realize a specific implementation of a pancake algorithm, every move when we find the greatest of the sized array and flipping can be modeled through __________
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!
