经典排序之插入排序
摘要:
1 #include <iostream> 2 #include <stdio.h> 3 #include <string.h> 4 using namespace std; 5 6 int main() 7 { 8 int i,j,tem; 9 int length;10 int a[]={2,43,24,19,25,39,11,6,5};11 // length = a.length();12 length = sizeof(a)/sizeof(int);13 cout<<length<<endl;14 printf(" 阅读全文
posted @ 2012-03-25 12:37 NewPanderKing 阅读(212) 评论(0) 推荐(0) 编辑