鹰之歌

摘要：一.实现1）第一种写法：#include<iostream.h>#include<stdlib.h>#include<time.h>#define LENGTH 15void Merge(int a[],int left,int right,int rightend){ int leftend=right-1; int n1=leftend-left+1; int n2=rightend-right+1; int *tempArrayA=(int*)malloc(sizeof(int)*n1); int *tempArrayB=(int*)malloc(si 阅读全文

摘要：1.伪代码及算法描述：2.C/C++代码实现：#include<iostream.h>void InsertionSort(int arr[],int n){ int key; int i; for(int j=1;j<n;j++) { key=arr[j]; i=j-1; while(i>=0&&key<arr[i]) { arr[i+1]=arr[i]; i--; } arr[i+1]=key; }}void DisPlay(int ... 阅读全文