数据结构
明玉似水
这个作者很懒,什么都没留下…
展开
-
冒泡
偶尔空闲,看看数据结构,来个冒泡排序public static void main(String[] args) { int []n = {3,2,1,89,12,34,90,56,22,43,100,78}; for (int out = n.length-1; out >0; out--) { for (int in = 0; in < out; in++) { if原创 2017-06-30 15:58:21 · 214 阅读 · 0 评论 -
选择
public static void main(String[] args) { int []n = {3,2,1,89,12,34,90,56,22,43,100,78}; int min ; for (int out = 0; out <n.length; out++) { min = n[out]; for (int in = out+1; in < n.length原创 2017-06-30 16:13:39 · 250 阅读 · 0 评论 -
插入
public static void main(String[] args) { int []n = {3,2,1,89,12,34,90,56,22,43,100,78}; for (int out = 1; out <n.length; out++) { for (int in = out; in >0; in--) { if(n[in]<=n[in-1]){原创 2017-06-30 16:34:21 · 420 阅读 · 0 评论 -
快速
public static void sort(int[]arr,int left,int right){ int l=left,r=right; if(l-r>=0){ return; } int pIndex = (l+r)/2; int pData = arr[pIndex]; while(l<=r) { if(arr[l]<pData){ l原创 2017-08-02 16:56:06 · 277 阅读 · 0 评论