###### android

####
Data structure and algorithm-sorting

Simple sorting Here, the data is sorted from small to large Bubble Sort thought Comparing the size of two adjacent numbers every time, exchange positions if the front is larger than the back Time complexity: O(n^2) Diagram Implementation package com.study.sort.SimpleSort; public class Bubble { public static void main (String[] args) { int [] a = { 1 , 9 , 3 , 4 , 5 , 6 , 7 }; int [] a1 = { 1 , 9 , 3 , 4 , 5 , 6 , 7 }; bubbleSort(a); BubbleSort(a1); } // Simple bubble sort public static void bubb