Question

Bubble Sort Algorithm in Java in decreasing order

Bubble Sort Algorithm in Java in decreasing order

Homework Answers

Answer #1
public class BubbleSortDescending {

    public static void bubbleSort(int[] list) {
        int temp;
        for (int i = 0; i < list.length; ++i) {
            for (int j = 0; j < list.length - 1; ++j) {
                if (list[j] < list[j + 1]) {
                    temp = list[j];
                    list[j] = list[j + 1];
                    list[j + 1] = temp;
                }
            }
        }
    }

    public static void print(int[] list) {
        for (int i = 0; i < list.length; ++i) {
            System.out.print(list[i] + " ");
        }
        System.out.println();
    }

    public static void main(String[] args) {
        int[] arr = {9, 12, 17, 19, 21, 15, 6, 5};
        System.out.print("Original array: ");
        print(arr);
        bubbleSort(arr);
        System.out.print("Sorted array: ");
        print(arr);
    }
}

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Write a Java Program to bubble sort 10,20,15,0,6,7,2,1,-5,55. Including Algorithm flowchart of the program.
Write a Java Program to bubble sort 10,20,15,0,6,7,2,1,-5,55. Including Algorithm flowchart of the program.
In Java: Create a bubble, insertion, selection sort algorithm that sorts the following: 6 9 8...
In Java: Create a bubble, insertion, selection sort algorithm that sorts the following: 6 9 8 12 3 1 7
Using Python: 1. A simple sorting algorithm is called a "Bubble Sort" because elements bubble around...
Using Python: 1. A simple sorting algorithm is called a "Bubble Sort" because elements bubble around through the list. It is also called a "Sinking Sort" because the larger values "sink" to the end (bottom) of the list. A bubble sort iterates through a list and swaps adjacent pairs if they are in the wrong order. The sort continues until all elements are correctly ordered. Example: bubbleSort([0, 1, 8, 4, 3, 2, 9]) - as it begins to process will...
The bubble sort algorithm discussed in class is used to sort the following sequence of integers:...
The bubble sort algorithm discussed in class is used to sort the following sequence of integers: 47 29 1 9 5 23 • How many passes must the algorithm perform to guarantee the entire sequence is sorted? • What is the list obtained after the first pass? • What is the list obtained after the third pass? • What is the list obtained after the final pass?
Write a version of the bubble sort algorithm in a function called bubbleSort that can be...
Write a version of the bubble sort algorithm in a function called bubbleSort that can be used to sort a string vector object. Also, write a program to test your algorithm. The program should prompt the user for a series of names. The string zzz should end the input stream. Output the sorted list to the console. *need answer in C++*
Java : Modify the selection sort algorithm to sort an array of integers in descending order....
Java : Modify the selection sort algorithm to sort an array of integers in descending order. describe how the skills you have gained could be applied in the field. Please don't use an already answered solution from chegg. I've unfortunately had that happen at many occasion ....... ........ sec01/SelectionSortDemo.java import java.util.Arrays; /** This program demonstrates the selection sort algorithm by sorting an array that is filled with random numbers. */ public class SelectionSortDemo { public static void main(String[] args) {...
# Implement the Bubble Sort algorithm to this code. Add output statements to the code to...
# Implement the Bubble Sort algorithm to this code. Add output statements to the code to verify that it is working properly. Then, add code that will short circuit the sort process if at any time an intermediate pass through the list identifies that the entire list is already sorted. def bubbleSort(theSeq): n = len(theSeq) #perform n - 1 bubble operations on the sequence for i in range(n - 1): #bubble largest item to end for j in range(i +...
Given the recursive bubble sort algorithm, analyze its time complexity in terms of Big O. bubbleSort(A[],...
Given the recursive bubble sort algorithm, analyze its time complexity in terms of Big O. bubbleSort(A[], n) { // Base case if (n == 1) return;    // One pass of bubble sort. After // this pass, the largest element // is moved (or bubbled) to end. for (i=0; i<n-1; i++) if (A[i] > A[i+1]) swap(A[i], A[i+1]);    // Largest element is fixed, // recur for remaining array bubbleSort(A, n-1); }
Why is insertion sort considered better than bubble sort and does it have any significant impact...
Why is insertion sort considered better than bubble sort and does it have any significant impact on the total run time for N where n is the number of data points? (java)
23 30 35 43 4 10 22 4 Complete the following: a) Use the bubble sort...
23 30 35 43 4 10 22 4 Complete the following: a) Use the bubble sort to sort the values showing the order of the values in the list after every pass of the sorting algorithm.   b) What is the time complexity of the sort (use the number of comparisons required as a measure of time.)    c) Modify the algorithm so it stops if there are no swaps in a complete pass. How many comparisons would be needed in your...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT