Purchase Solution

Creating a sorting array

Not what you're looking for?

Ask Custom Question

This is what I want to achieve. I have an array of positive integers which I wish to sort according to the sequence represented by the integer number line. The bubble sort operates as follows:

1. Find the two adjacent elements, X and Y, in the array such that X > Y and swap X and Y, then sort the resulting array.

2. If there is no adjacent pair of elements, X and Y, in the array such that X > Y, the list is sorted.

Note that the purpose of swapping two elements X and Y that occur out of order is so that after the swap, the new list is closer to a sorted list. After a sufficient amount of swapping, we should end up with all the elements in order. For example given the array:

{1 2 5 4 7 3 6 8 10 9}

we would commence by finding the elements 5 and 4 and swap them to get:

{1 2 4 5 7 3 6 8 10 9}

We would then continue as follows:

{1 2 4 5 7 3 6 8 10 9}
{1 2 4 5 3 7 6 8 10 9}
{1 2 4 3 5 7 6 8 10 9}
{1 2 3 4 5 7 6 8 10 9}
{1 2 3 4 5 6 7 8 10 9}
{1 2 3 4 5 6 7 8 9 10}

Design and implement a Java program which sorts a 10 element integer array using the bubble sort process. The elements of the array to be sorted should be supplied by the user (assume the user will not input duplicates).

Create a GUI front end for your bubble sort program.

Purchase this Solution
Solution Summary

The expert creates a sorting array. Adjacent pairs of elements in an array are determined. The solution is provided in a Java file.

Solution Preview

Dear Student,
Find the solution attached. Study the code carefully. It accepts user ...

Solution provided by:
Champake Mendis, MEngSc, PhD
Education
  • BSc (Hons), University of Colombo - Sri Lanka
  • MEngSc, University of Melbourne
  • Certificate IV in Training & Assessment , Australian Business Council
Recent Feedback
  • "Thank you!"
  • "Thank you."
  • "Thanks a lot for you help and support"
  • "Sorry about the late payment but the assignment was sufficient and appreciated. Good work"
  • "Great description! Thank you for your quick response."
Purchase this Solution
Free BrainMass Quizzes
Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

View More Free Quizzes
Related BrainMass Solutions

  • Creating a Java Program that Sorts a 10 Element Integer Array

    94501 Creating a Java Program that Sorts a 10 Element Integer Array Design and implement a Java program which sorts a 10 element integer array using the bubble sort process.

  • Find the Largest and Smallest and Sort values in array C++

    You should be able to use the two functions to achieve what you want including sorting of an array. For sorting, you need to do a little bit more than just finding minimum and maximum from an array.

  • Java Programming: SchoolTextBook Class

    Next prompt the used to enter a field for sorting, sort the array of objects based on the user input, and then display the newly sorted array of objects.

  • Design and Analysis of Algorithms

    Creating a heap in an array is simulating a binary tree on top of the array.

  • Seating arrangement to increase social contact

    This array gets modified in this solution. // p indicates number of programs. // q indicates number of tables. // Considering that a worst case NlogN sorting algorithm is chosen wherever sorting is required.

  • Most favorite loop structure

    An example using a C array is analyzed.

  • sorting an array of integers in linear time

    Step 4: collect the result from each sorted sorted array. If sorting ascendingly, then collect the result starting from array 1 up to array nk, scan the arrays from array 1 up to array nk and write all the results to a new array.

  • Sorting in Java

    6554 Sorting in Java Pseudocodes Part (A) Sort the array 15 80 35 25 60 30 into descending order using a) the selection sort. b) the buble sort.

  • Sorting Algorithms

    111757 Sorting Algorithms Sort the following array using insertion sort manually: 7-4-1-6-2-3-8-5. Show the results after each pass in a table. Explain, briefly, what happens in each row. Sort the same array using quick sort manually.

View More Related Solutions