- 博客(5)
- 收藏
- 关注
RSS订阅原创 单链表逆置递归算法(C语言)
<br />#include <stdio.h>typedef int Element;typedef struct LinkListType{ Element data; struct LinkListType * next;} LinkList ;//reverse a link list recursivelyLinkList * reverse(LinkList * pre, LinkList * cur){ if(!cur)
2010-12-08 22:50:00
4682
1
原创 算法导论-Inversion Pair算法
import java.util.*;public class InversionPair { public static int inversion(int[] a, int low, int mid, int high) { int count = 0; int left_size = mid-low+2; int[] left = new int[left_size]; for(int i=0; i
2010-12-07 21:23:00
1278
原创 Java二分法(Binary Search)查找递归算法与迭代算法
<br />public class BinarySearch { public static int search(int[] a, int k) { int index = -1; int low = 0; int high = a.length-1; while(low<high) { int mid = low + (high-low)/2; if(k==a[mid]) { index = mid; break; } els
2010-12-06 20:02:00
2743
原创 Java插入排序递归算法（insert sorting recursively）
<br />import java.util.*;public class InsertSort { public static void sort(int[] a, int m) { if(m==0) { return; } sort(a, m-1); int k = a[m]; while(m>0 && k<a[m-1]) { a[m]=a[m-1]; m--; } a[m]=k; } public stati
2010-12-05 21:48:00
1308
原创 JAVA归并排序算法
<br />import java.util.*;public class MergeSort { public static void merge(int[] a, int low, int mid, int high) { System.out.printf("low=%d,mid=%d,high=%d/n",low, mid, high); int left_size = mid-low+1; int[] left = new int[left_size]; f
2010-12-05 20:44:00
630
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人