冒泡排序、选择排序、插入排序

匿名 (未验证) 提交于 2019-12-03 00:26:01

1

00101121

public class ArraySort {
public static void main(String[] args) {
int[] array = {1, 7, 3, 9, 2,8, 5, 4, 6};
sort(array);
for (int i = 0; i < array.length; i++) {
out.println(array[i]);


public static int[] sort(int[] array) {
for (int i = 1; i < array.length; i++) {
for (int j = 0; j < array.length-i; j++) {
if (array[j] > array[j+1]) {
int temp = array[j];
1];
1] = temp;



return array;

}

2

011

public class ArraySort {
public static void main(String[] args) {
int[] array = {1, 7, 3, 9, 2,8, 5, 4, 6};
sort(array);
for (int i = 0; i < array.length; i++) {
out.println(array[i]);


public static int[] sort(int[] array) {
for (int i = 0; i < array.length; i++) {
int temp = i;
for (int j = i+1; j < array.length; j++) {
if (array[temp] > array[j]) {



int t = array[temp];



return array;

}

3

N-1

public class ArraySort {
public static void main(String[] args) {
int[] array = {1, 7, 3, 9, 2,8, 5, 4, 6};
sort(array);
for (int i = 0; i < array.length; i++) {
out.println(array[i]);


public static int[] sort(int[] array) {
for (int i = 1; i < array.length; i++) {
int temp = array[i];
int in = i;
while (in > 0 && array[in-1] >= temp) {
1];




return array;

}

标签
易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!