先看代码
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a = {9,5,4,3,7,3,2,1,2};//数据范围是0-10
for(int i = a.len...
1、比较相邻的两个元素，如果前面一个比后面一个大，则交换 public static void main(String[] args) { int []a = {5,9,7,4,1,3,2,8}; for (int i = 0;i<a.length-1;i++){ for (int j = 0;j<a...
原理public class Test{ public static void main(String args[]) { int a[]={5,7,4,3,7,4,3,2,7}; int t; for(int i=0;i<a.length-1;i++)//共进行a.length-1趟排序 { for(int j=0;j<a.l...
public class BubbleSort {
public static void main(String[] args) {
int[] arr = {24, 69, 80, 57, 13};
int temp = 0;
for (int i = 0; i < arr.length-1; i++) {
...
public class Maopaopaixu {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr= {1,2,3,4,5};
int tmp=0;
//保证按照数组长度进行循环保证...
#include <stdio.h>
#include <stdlib.h>
int main(int agrc,char*agrv[])
{
int a[6]={9,3,78,91,48,39};
int temp,n;
n=sizeof(a)/sizeof(int);
printf("%d\n...
