Question

Home Work No.2 due 09.11.2019 either ascending or descending SORTING: An array is said to be ordered if its values order. In an ascending ordered array, the value of each element is less than or equal to the value of the next element. That is, [each element] <= [next element]. A sort is an algorithm for ordering an array. Of the many different techniques for sorting an array we discuss the bubble sort It requires the swapping of values sorted in a pair of variables. If var1, var2, and temp are all variables of the same type, then the statements temp varl varl-var2 var2-temp Assign varl's value to var2 and var2's value to varl Bubble Sort: The bubble sort is an algorithm that compares adjacent items and swaps those that are out of order. If this process repeated enough times , the list will be ordered Let's carry out this process on the list The steps for each pass through the list are as follows: 1.Compare the first and second items. If they are out of order, swap them. 2. Compare the second and third item. If they are out of order, swap them 3.Repeat this pattern for all remaining pairs The first time through the list, this process is repeated to the end of the list. This is called first pass. After the first pass the last item will be in its proper position. Therefore, the second pass does not have to consider it and so requires one less comparison. At the end of the second pass, the last two items will be in the proper position. Each successive pass requires one less comparison. After four passes, the last four items will be in their proper positions, and hence, the first will be also. As a specific example of this process, consider the list of numbers 21 13 17 5 3 This process completes the first pass through the data and results in the largest number moving to the hottom of the tist. As the largest value sinks to its resting place at the bottom of the list, the smaller elements slowly rise, or "bubble" to the top of the list. This bubbling effect of the smaller elements is what gave rise to the namne "bubble" sort for this sorting algorithm. Use Methods: void PrintList ( void BubbleSort () void SortList

Programming language: Java

Answer 1

ANSWER: Here I am giving you the code and output if you have any doubt you can comment or like my solution.

NOTE: Here no need of SortList() method this problem can be solved by using only two methods and there is no description is given for each method also.

CODE:

public class SortAnArray {

   void BubbleSort(int array[])
{
int n = array.length;
for (int i = 0; i < n-1; i++)
for (int j = 0; j < n-i-1; j++)
if (array[j] > array[j+1])
{

int temp = array[j];// swapping the value of the array when condition becomes true.
array[j] = array[j+1];
array[j+1] = temp;
}
}

  
void PrintList(int array[])
{
int n = array.length;
for (int i=0; i<n; ++i)
System.out.print(array[i] + " ");
System.out.println();
}

public static void main(String args[])
{
   SortAnArray ob = new SortAnArray();
  
int array[] = {84, 24, 15, 92, 32, 18, 98};// created an array which is not sorted.
  
  
System.out.println("Array before bubble sort:");
ob.PrintList(array);
ob.BubbleSort(array);
System.out.println("Array After bubble sort:");
ob.PrintList(array);
}

}

OUTPUT:

Array before bubble sort: 84 24 15 92 32 18 98 Array After bubble sort: 15 18 24 32 84 92 98