JAVA冒泡、插入、選擇排序算法

1、java冒泡、插入、選擇排序算法 常常在筆試(或面試)中消失的java經(jīng)典算法,本人特此整理,盼望有用 import java.io.*; public class paixu / 冒泡排序法 public void maopao(int a) for (int i = 1; i a.length; i+) for (int j = 0; j a.length - i; j+) if (aj aj + 1) int temp = aj + 1; aj + 1 = aj; aj = temp; / 插入排序法： public void charu(int a) for (int i = 1; i

2、 a.length; i+) for (int j = 0; j i; j+) if (aj ai) int temp = ai; for (int k = i; k j; k-) ak = ak-; aj = temp; / 選擇排序法： public void xuanze(int a) for (int i = 0; i a.length; i+) int position = i; for (int j = i + 1; j a.length; j+) system.out.println(n + 采納插入排序法：); system.out.println(n + 采納冒泡排序法：);

3、 常常在筆試(或面試)中消失的java經(jīng)典算法,本人特此整理,盼望有用 if (aposition aj) int temp = aposition; aposition = aj; aj = temp; system.out.println(n + 采納選擇排序法：); public void print(int a) system.out.println(從小到大排序結(jié)果為：); for (int i = 0; i a.length; i+) system.out.print(ai + ,); public static void main(string args) int a = new

4、 int5; paixu px = new paixu(); bufferedreader buf = new bufferedreader( new inputstreamreader(system.in); system.out.println(請輸入五個(gè)整數(shù)：); for (int i = 0; i a.length; i+) try string s = buf.readline(); int j = integer.parseint(s); ai = j; catch (exception e) system.out.println(出錯(cuò)了！必需輸入整數(shù),請重新輸入!); i-; s

5、ystem.out.println(您輸入的整數(shù)依次為：); for (int i = 0; i a.length; i+) system.out.print(ai + ,); 常常在筆試(或面試)中消失的java經(jīng)典算法,本人特此整理,盼望有用 system.out.println(n + -); px.maopao(a); / 調(diào)用冒泡算法 px.print(a); system.out.println(n + -); px.charu(a); / 調(diào)用插入算法 px.print(a); system.out.println(n + -); px.xuanze(a); / 調(diào)用選擇算法 p

6、x.print(a); java實(shí)現(xiàn)二分查找 2021-11-19 21:38 今日阿朗被問到二分查找竟然一焦急沒寫出來。faint =。= 回來復(fù)習(xí)下 import java.util.*; public class binarysearch public static void main(string args) arraylistinteger a = new arraylistinteger(); addintegerinsequence(a,1,10); print(a); int pos = binarysearch(a,10); if ( pos != -1 ) system.o

7、ut.print(element found: + pos); else system.out.print(element not found); /* * 二分查找法 * param a * param value 待查找元素 常常在筆試(或面試)中消失的java經(jīng)典算法,本人特此整理,盼望有用 * return */ public static int binarysearch(arraylistinteger a, int value) int size = a.size(); int low = 0 , high = size - 1; int mid; while (low = hi

8、gh) mid = (low + high) / 2; if ( a.get(mid) value ) low = low + 1; else if ( a.get(mid) value ) high = high - 1; else return mid; return -1; /* * 填充挨次元素到數(shù)組 * param a * param begin 開頭元素 * param size 大小 */ public static void addintegerinsequence(arraylistinteger a, int begin, int size) for (int i = be

9、gin; i begin + size; i+) a.add(i); /* * 打印數(shù)組 * param a */ 常常在筆試(或面試)中消失的java經(jīng)典算法,本人特此整理,盼望有用 public static void print(arraylistinteger a) iteratorinteger i = a.iterator(); while (i.hasnext() system.out.print(i.next() + ); system.out.println(); / java 庫中的二分查找使用非遞歸方式實(shí)現(xiàn)，返回結(jié)果與前面寫的有所不同：找不到時(shí)返回的是負(fù)數(shù)，但不肯定是-1 private static int binarysearch0(int a, int fromindex, int toindex, int key) int low = fromindex; int high = toindex - 1; while (low = high) int mid = (low + high) 1; int midv