摘要:
代码:#include "iostream"#include "cmath"#define null 0using namespace std;typedef struct node{ int data; struct node *next;}Link;//定义链表结点Link *createLink(Link *head){ Link*tail; head=tail=(Link*)malloc(sizeof(Link)); head->next=null; int data; cin>>data; Link *p; while(dat 阅读全文
摘要:
代码:#include "iostream"using namespace std;int counting_sort(int a,int b,int A[],int B[],int k){ int C[10]; int i; for(i=0;i<=k;i++) C[i]=0; for(i=1;i<12;i++){ C[A[i]]++; } for(i=1;i<=k;i++) C[i]=C[i-1]+C[i]; return C[b]-C[a-1];}void display(int A[]){ int ... 阅读全文
摘要:
代码:#include "iostream"using namespace std;void counting_sort(int A[],int B[],int k){ int C[10]; int i; for(i=0;i<=k;i++) C[i]=0; for(i=1;i<=8;i++) C[A[i]]++; for(i=1;i<=k;i++) C[i]=C[i-1]+C[i]; for(i=8;i>=1;i--){ B[C[A[i]]]=A[i]; C[A[i]]--; }}v... 阅读全文
摘要:
代码:#include"iostream"using namespace std;int partition(int A[],int p,int r){ int i,j; int x=A[r]; i=p-1; for(j=p;j<r;j++){ if(A[j]>x){ i++; int temp=A[i]; A[i]=A[j]; A[j]=temp; } } int temp=A[i+1]; A[i+1]=A[r]; A[r]=te... 阅读全文
摘要:
代码:#include "iostream"#define null 0using namespace std;typedef struct node{ int data; struct node *next;}Link;int heap_size=3;Link* createLink(){ int data; Link *t,*h=null,*p; cin>>data; int i=0; while(data!=0){ p=(Link*)malloc(sizeof(Link)); p->data=data; ... 阅读全文
摘要:
代码:#include "iostream"using namespace std;int heap_size;int left(int i){ return 2*i;}int right(int i){ return 2*i+1;}void max_Heapify(int A[],int i){ int l,r,largest; l=left(i); r=right(i); int temp; if(l<=heap_size&&A[i]<A[l]) largest=l; else largest=i; if(r... 阅读全文
摘要:
代码:#include "iostream"#define MAX 0x7fffffffusing namespace std;int B[20],heap_size=0;int counter=0;int parent(int i){ return i/2;}int left(int i){ return 2*i;}int right(int i){ return 2*i+1;}void decrease_Key(int A[],int i,int key){ int temp; A[i]=key; while(i>1&&A[parent(i)]&g 阅读全文
摘要:
#include "iostream"using namespace std;int parent(int i){ return i/2;}int left(int i){ return 2*i;}int right(int i){ return 2*i+1;}int heapSize;void display(int A[],int size){ for(int i=1;i<=size;i++) cout<<A[i]<<" "; cout<<endl;}void maxHeapify(int A[],int i 阅读全文
摘要:
题目:MAX-HEAPIFY的代码效率较高,但第10行中的递归调用可能例外,它可能使某些编译程序产生低效的代码。请用迭代的控制结构(循环)取代递归结构,从而写一个更为高效的MAX-HEAPIFY。代码:#include "iostream"using namespace std;int LEFT(int i){ return 2*i+1;}int RIGHT(int i){ return 2*i+2;}void MAX_HEAPIFY(int A[],int i){ int l,r,largest; int t; while((l=LEFT(i))<10){ ... 阅读全文
摘要:
题目:在order结构中添加另一个函数,该结构返回一个格式化的字符串,以合适的值替换用尖括号括起来的斜体条目。Order Information:<unit count> <item name> items at $<unit cost> each,total cost $<total cost>代码:using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Text.RegularExpressions;names 阅读全文