摘要：
1 import java.util.Scanner; 2 3 /** 4 * @author Administrator 递归算法折半查找 5 */ 6 public class zhebanchazhao_1 { 7 8 public static void main(String[] args) { 9 10 int[] a = new int[100];11 int x;12 Scanner cin = new Scanner(System.in);13 14 x = cin.nextInt();15 ... 阅读全文
posted @ 2013-12-10 22:42
天天AC
阅读(360)
评论(0)
推荐(0)
摘要：
1 import java.util.Scanner; 2 3 /** 4 * @author Administrator 折半查找 5 */ 6 public class zhebansousuo { 7 8 public static void main(String[] args) { 9 int[] a = new int[100];10 int x, b;11 Scanner cin = new Scanner(System.in);12 x = cin.nextInt();13 14 ... 阅读全文
posted @ 2013-12-10 22:41
天天AC
阅读(295)
评论(0)
推荐(0)
摘要：
1 # include 2 # include 3 using namespace std; 4 void visit(int e) 5 { 6 printf("%d ",e); // 以整型格式输出 7 } 8 void mid(int treenode) 9 {10 if (treenode > 5)11 return;12 visit(treenode); /*访问treenode节点*/13 mid(treenode * 2);14 mid(treenode*2 + 1);15 }16 int main()17 {18 ... 阅读全文
posted @ 2013-12-10 17:52
天天AC
阅读(189)
评论(0)
推荐(0)
摘要：
1 # include 2 # include 3 using namespace std; 4 int main() 5 { 6 int m; 7 int tree[1111]; 8 cin>>m; 9 for(int i = 0; i m)19 flag = 1;20 else21 count = count*2;22 }23 else if(flag == 1)24 {25 if(count*2... 阅读全文
posted @ 2013-12-10 17:43
天天AC
阅读(215)
评论(0)
推荐(0)
摘要：
1 # include 2 # include 3 using namespace std; 4 int inorder(int i,int j) 5 { 6 if(i<=j) 7 printf("%d ",i); 8 if(2*i<=j) 9 inorder(2*i,j);10 if(2*i+1<=j)11 inorder(2*i+1,j);12 return 1;13 }14 int main()15 {16 inorder(1,5);17 }View Code 阅读全文
posted @ 2013-12-10 17:38
天天AC
阅读(223)
评论(0)
推荐(0)
摘要：
非递归算法对完全二叉树的前序遍历代码 1 # include 2 # include 3 using namespace std; 4 const int m = 100; 5 struct b 6 { 7 char data; 8 int num; 9 }se[m];10 int main()11 {12 stacks;13 int n;14 cin>>n;15 for(int i = 0;i >se[i].data;18 }19 se[0].num = 0;20 int root = se[0].num;21 ... 阅读全文
posted @ 2013-12-10 17:28
天天AC
阅读(300)
评论(0)
推荐(0)
浙公网安备 33010602011771号