Chapter 7 Exercise 18, Introduction to Java Programming , Tenth Edition Y. Danie
ID: 3783411 • Letter: C
Question
Chapter 7 Exercise 18, Introduction to Java Programming, Tenth Edition Y. Daniel Liang. Please write your own code.
7.18 (Bubble sort) Write a sort method that uses the bubble-sort algorithm. The bubblesort algorithm makes several passes through the array. On each pass, successive neighboring pairs are compared. If a pair is not in order, its values are swapped; otherwise, the values remain unchanged. The technique is called a bubble sort or sinking sort because the smaller values gradually “bubble” their way to the top and the larger values “sink” to the bottom. Write a test program that reads in ten double numbers, invokes the method, and displays the sorted numbers.
Console terminated> ProgrammingEx7-18 va Al cation] F Enter ten numbers 0 35 4 70 1 2 10 90 The array after sort is 1.0 0.0 0.0 2.0 3.0 4.0 5.0 7.0 10.0 90.0Explanation / Answer
BubbleSortExample.java
import java.util.Scanner;
public class BubbleSortExample {
static void bubbleSort(int[] arr) {
int n = arr.length;
int temp = 0;
for(int i=0; i < n; i++){
for(int j=1; j < (n-i); j++){
if(arr[j-1] > arr[j]){
//swap elements
temp = arr[j-1];
arr[j-1] = arr[j];
arr[j] = temp;
}
}
}
}
public static void main(String[] args) {
int[] arr=new int[10];
Scanner sc=new Scanner(System.in);
System.out.println("Please enter ten numbers : ");
for(int j=0;j<10;j++)
arr[j]=sc.nextInt();
System.out.println("Array Before Bubble Sort");
for(int i=0; i < arr.length; i++){
System.out.print(arr[i] + " ");
}
System.out.println();
bubbleSort(arr);//sorting array elements using bubble sort
System.out.println("Array After Bubble Sort");
for(int i=0; i < arr.length; i++){
System.out.print(arr[i] + " ");
}
}
}
Output:-
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.