bubble sort python

Bubble Sort:1 //complexity: O (n^2)2 //Number of comparisons: N (n-1)/2, mobile, etc. order of magnitude3#include 4#include 5#include 6 using namespacestd;7 Const intINF =0x7fffffff;8 voidBubble_sort (intAintN)9 {Ten for(inti = n1; I >=0; i--) One { AA[n] =A[i]; - int_max =-inf, pos =-1; - for(intj =0; J ) the { - if(_max J; - } -A[pos] =A[n]; +A[i] =_ma

1. Use the sort () in the arrays class in the Javaapi document to sort quickly Copy Code code as follows: Import Java.util.Arrays; public class testone{ public static void Main (String [] args) { int [] array={2,0,1,4,5,8}; Arrays.sort (array);//Call Arrays static method sort, sorted in ascending order for (int show:array) { Sy

$arr = [1, 8, 7, 5, 4, 2, 11, 9, 20];Bubble Sort: for($i= 0;$iCount($arr);$i++) { for($j= 0;$jCount($arr) -$i-1;$j++) { if($arr[$j] >$arr[$j+ 1]) { $item=$arr[$j]; $arr[$j] =$arr[$j+ 1]; $arr[$j+ 1] =$item; } }}Insert Sort: for($c= 1;$c=Count($arr);$c++) { $value=$arr[$c]; $i=$c-1; while($i> = 0 and$arr[$i] >$value) { //$arr [i + 1] for the underl

The bubbling sort has three record values, two of which point to two objects that need to be compared, one pointing to the end value of the numeric value that needs to be sorted.In,in+1,out Public classArraybub {Private Longa[]; Private intNelems; PublicArraybub (intmax) {a=New Long[Max]; Nelems=0; } Public voidInsertLongvalue) {A[nelems]=value; Nelems++; } Public voiddisplay () { for(intj=0;j) {System.out.print (A[j]+" "); } System.out.pr

Select sortselection sorting is a simple and intuitive sort algorithm whose core idea is to traverse an array, find the smallest element in a sequence that has never been sorted, and place it at the end of the sorted sequence. Complexity of Time: O (n^2) Stability: Unstable * * @brief selection Sort * /void Selection_sort (int a[], int n) { int i, J, Min, tmp; for (i = 0; i

Sort: Public class sortdemo {public static void main (string [] ARGs) {int [] arr = {5, 8, 9, 12, 55,565,421, 12,251 2,-5, -56}; // int [] arr = {6, 9, 4589,442,458,523 2,-788, 7,545,-44, 55,-11 //}; // selectionsort (ARR); // bubblesort (ARR); directinsertsort (ARR); printsort (ARR );} // select sorting. Each trip determines the number of ARR [I]. Each time the number of ARR [I] is equal to the number of all the following arr [J]. If the number is sa

var arr = [1,4,2,9,7,6,5,4,7,5]; //Bubble Sort (popularly speaking is J and J+1 Dozen, who wins who goes back)Forvar i = 1;i; i++) {for (var j = 0;j; j + +) {if (arr[j]>arr[j+1]) {var temp = arr[j]; ARR[J] = arr[j+1]; ARR[J+1] = temp; }}} console.log (arr);//Select sort (popularly speaking is J and I dozen, who wins who goes ahead)Forvar i = 0;i; i++) {for (var j

$arr [$j]) {$temp = $arr [$i]; $arr [$i] = $arr [$j]; $arr [$j] = $temp; }}} return $arr;} /** * Select sort sort selectsort key is to find the smallest array subscript *///$arr = Array (100,2,4,5,6,1,7,3); Array (1,2,4,5,6,100,7,3) the first time//array (1,2,4,5,6,100,7,3) The second time//array (1,2,3,5,6,100,7,4) The third time//array ( 1,2,3,4,6,100,7,5) Fourth times//...//ar

#include Bubble sort, select sort, insert sort difference

First, choose the sort (simplest)1. Principle:4 3 2 1The first number is compared with the second number, 4 > 3, and the first number is 3, the first number is the third number, so the first round gets the first number is the smallest one.2. Code:1 intarr[4] = {4,3,2,1};2 3 for(inti =0; I 3; i++){4 for(intj = i +1; J 4; J + +){5 if(Arr[i] >Arr[j]) {6 inttemp =Arr[i];7Arr[i] =Arr[j];8ARR[J] =temp;9 }Ten } One}Seco

JS Common bubble sort, quick sort, insert sort code sharing 4.2.1 Bubble Sort Algorithm Introduction parsing: Compare adjacent two elements, if the previous one is larger than the latter, swap position. In the first round, the l

The example in this article describes how Java uses a bubble sort array to sort the arrays. Share to everyone for your reference. Specifically as follows: First, bubble sort: Sort arrays by