Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Add a method bubbleSort to the class ArraySorter, that performs a bubble sort of an array. The bubble sort algorithm examines all adjacent pairs of

Add a method bubbleSort to the class ArraySorter, that performs a bubble sort of an array. The bubble sort algorithm examines all adjacent pairs of elements in the array from the beginning to the end and interchanges (swaps) any two elements that are out of order. Each interchange makes the array more sorted than it was, until it is entirely sorted.

The algorithm in pseudocode follows: Bubble sort algorithm to sort an array a

Repeat the following until the array a is sorted:

for (index = 0; index

if (a[index] > a[index + 1])

Interchange the values of a[index] and a[index + 1]

A good visualization of the algorithm in action can be found at: https: //en.wikipedia.org/wiki/Bubble_sort#/media/File:Bubble-sort-example-300px. gif

Please use the Implementation of the selection sort below to add the sorting algorithms as static methods. Recommand use IDE and with possilbe comments

Here is codes of Array Sorter

public class ArraySorter { /** Precondition: Every element in anArray has a value. Action: Sorts the array into ascending order. */ public static void selectionSort(int[] anArray) { for (int index = 0; index < anArray.length - 1; index++) { // Place the correct value in anArray[index] int indexOfNextSmallest = getIndexOfSmallest(index, anArray); interchange(index, indexOfNextSmallest, anArray); //Assertion:anArray[0] <= anArray[1] <=...<= anArray[index] //and these are the smallest of the original array elements. //The remaining positions contain the rest of the original //array elements. } } /** Returns the index of the smallest value in the portion of the array that begins at the element whose index is startIndex and ends at the last element. */ private static int getIndexOfSmallest(int startIndex, int[] a) { int min = a[startIndex]; int indexOfMin = startIndex; for (int index = startIndex + 1; index < a.length; index++) { if (a[index] < min) { min = a[index]; indexOfMin = index; //min is smallest of a[startIndex] through a[index] } } return indexOfMin; } /** Precondition: i and j are valid indices for the array a. Postcondition: Values of a[i] and a[j] have been interchanged. */ private static void interchange(int i, int j, int[] a) { int temp = a[i]; a[i] = a[j]; a[j] = temp; //original value of a[i] } }

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

The Structure Of The Relational Database Model

Authors: Jan Paredaens ,Paul De Bra ,Marc Gyssens ,Dirk Van Gucht

1st Edition

3642699588, 978-3642699580

More Books

Students also viewed these Databases questions

Question

2. What is the meaning and definition of Banking?

Answered: 1 week ago

Question

3.What are the Importance / Role of Bank in Business?

Answered: 1 week ago

Question

=+ Are there additional forms of employee representation?

Answered: 1 week ago

Question

=+What is the nature of their impact?

Answered: 1 week ago