bubble backdrop

Solve the problem as follows:1. Seek the 1+2!+3!+...+20! and.2. Gets the maximum and minimum values in the array.3. Select sort, bubble sort for array.4. Find the location of a number in the array (binary lookup).binary Find: for the lookup of the sequential table, the array is stored in sequential elements, by the following method:Define the variable Low,mid,high to the lowest, middle, and highest-bit elements in the array, comparing the elements to

First, the basic ideaBubble sort is a sort of numeric-based exchange, starting with the first element, and comparing it to an element immediately following it, if the current number is larger, then the values of the two are exchanged, then the larger elements move backwards like bubbles. The nth order allows the nth element to go backwards in the past. After a "bubbling operation" such as n-1, the entire sequence is ordered.Second, the implementation of the Code Public classBubblesortImplementsi

Bubble sort: Gives a list of pure numbers. Please sort the list.Ideas:1. Complete the data exchange between A and B. For example, a = ten, B = 24 after exchange, A = 10, B =2. Loop the list. Determine the size relationship between A[i] and a[i+1], if a[i] is larger than a[i+1. Then swap. At the end of the cycle. The largest data in the current list is moved to the far right.3. Think about it if you perform the above operation again. Finally, the secon

The algorithm needs to master the simple bubble sort words not much to say we look at the following:/** * Put a chaotic array int arr[] = {2,2323,23,456,1,342}; * According to the order that we often say the sort of counterfeit * or as we have said before when we encounter problems, we dismembered the problem. * 1, first we want to put a chaotic array into order, we should first find out the largest (or the smallest) * 2, and then we sequentially fol

/// ///Select Sort--recursive notation/// /// Array /// Start subscript /// End Subscript Public voidSelectsort (int[] Data,intStartintend) { inttemp =0; if(Start >= end)return; for(inti = start +1; I ) { if(Data[i] Data[start]) {Temp=Data[i]; Data[i]=Data[start]; Data[start]=temp; }} selectsort (data, start+1, end); } /// ///Bubble Sort/// /// Array

public class hellojava{public static void Main (string[] args) {int[] arr1 = new int[] {20,40,90,30,80,70,50};Bubblesort (ARR1);int[] arr2 = new int[] {11,52,4,5,65,4,2,1,45};Bubblesort (ARR2);}public static void Bubblesort (int[] array) {System.out.println ("Before sorting:");for (int i=0; iSystem.out.print (array[i]+ "");}System.out.print ("\ n" + "bubble sort after:" + "\ n");int flag;for (int i=1; iFlag = 0;for (int j=0; jif (Array[j] > array[j+1]

Bubble sort is the first contact of the sorting method, the idea is very simple, two-layer cycle, the number of neighbors compared to the small rise of large sinking.As for the choice of sorting, the idea is somewhat similar to the insertion sort, but the range of comparisons becomes from the current number I to n-1, find the smallest number, write down the subscript, and complete an exchange in the outer loop. However, a decision on the size comparis

Bubble sortCode#include voidPrintlist (intIlist[],intIlen) { inti =0; for(i =0; i ) {printf ("%d", Ilist[i]); } printf ("\ n");}intBubblesort (intIlist[],intIlen) { inti =0, j =0; for(i =0; I 1; i++) { for(j =0; J 1; J + +) { if(Ilist[j] 1]) { Continue; } intITemp =Ilist[j]; ILIST[J]= Ilist[j +1]; Ilist[j+1] =iTemp; } printf ("%d:", i); Printlist (IList, Ilen); } return 0;

The bubbling algorithm, as its name implies, is the data arranged in a certain order.Algorithm ideas:Suppose there is an array of suchInt[] arr = {5, 9, 3, 1, 2, 6, 7, 4, 8};According to the algorithm definition, the output we need isInt[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9};First, get our original array. Determine the size of arr[0] and arr[1] first. If ARR[0]>ARR[1], their location is exchanged. Then compare the sizes of arr[1] and arr[2], and if arr[1]>arr[2], swap their positions. And so on, a

//////Select sort//////Staticvoid Sort1 (Int[] arr) {int len =Arr. Length;for (var i =0; I ) {int min =Ifor (var n = i +1; N ) {if (Arr[n) Arr[min]) {min =N } }var temp =Arr[i]; Arr[i] =Arr[min]; Arr[min] =Temp } }//////Bubble sort//////Staticvoid Sort2 (Int[] arr) {int len =Arr. Length;for (var i =0; I ) {for (var n = i +1; N ) {if (Arr[n) Arr[i]) {var temp =Arr[i]; Arr[i] =Arr[n]; Arr[i] =Temp } } } }Staticvoid Main (String[] args) {var arr =Newint[

The so-called array, is the same data type of elements in a certain order of the set, that is, the finite data type of the same variable with a name, and then use the number to distinguish their variable collection, the name is called the array name, the number is called subscript.Each variable that makes up an array is called the component or element of the array.The index of the elements in the array starts with 0, which is a "0", a "1" ....Quote: Bubble