Vb常用排序算法课设

[几种经典排序算法优劣比较的C程序实现]一、低级排序算法1.选择排序（1）排序过程给定一个数值集合，循环遍历集合，每次遍历从集合中选择出最小或最大的放入集合的开头或结尾的位置，下次循环从剩余的元素集合中遍历找出...+阅读

Option Explicit

Dim Arry() As String

Private Sub Command1_Click()

Dim i As Long, j As Long

Dim x As String, y As String

i = 1

ReDim Preserve Arry(i) As String

Open App.Path & ＂\111.txt＂ For Input As #1

While Not EOF(1)

Line Input #1, Arry(i)

i = i + 1

ReDim Preserve Arry(i) As String

Wend

ReDim Preserve Arry(i - 1) As String

Close #1

For i = 1 To UBound(Arry)

For j = 1 To UBound(Arry)

If j < UBound(Arry) Then

If Val(Arry(j)) > Val(Arry(j + 1)) Then

x = Arry(j)

y = Arry(j + 1)

Arry(j) = y

Arry(j + 1) = x

End If

Open App.Path & ＂\222.txt＂ For Output As #1

For i = 1 To UBound(Arry)

Print #1, Arry(i)

Next i

Close #1

End Sub

归并排序算法实现和比较2设计内容及要求：内容：实现两路归并排

到底几次移动还真不好说，因为下面的的方法中是把已排序的两个子数组拷贝出去在整合进来。三路MergeSort谁出的题？闲着蛋疼啊，二路的时间复杂度是T(n)=2T(n/2)+O(n),->T(n)=O(nlgn)。三路的时间复杂度是T(n)=3T(n/3)+O(n),->T(n)=O(nlgn)。复杂度没变，设计却复杂了。我不写了，你看着办吧 #include#includeint cmp = 0; int mv = 0; // [p..q,q+1..r] void Merge(int a[], int p, int q, int r) { int n1 = q - p + 1; int n2 = r - q; int *a1 = (int*)malloc(sizeof(int)*n1); if(!a1) { printf(＂malloc error! a1\n＂); return; } int *a2 = (int*)malloc(sizeof(int)*n2); if(!a2) { printf(＂malloc error! a2\n＂); free(a1); return; } int i, j, k; for(i = 0; i

数据结构的课程设计拓扑排序的算法

#include

int mat[105][105]；/*存图的边*/

int indeg[105]；/*存入度*/

int ans[105]；/*结果*/

int top =0;

void main()

{

int n；/*图大小*/

int m；/*边个数*/

int i,j;

int a,b;

scanf(＂%d%d＂,&n,&m);

for(i=0;i

{

scanf(＂%d%d＂,&a,&b);

/*a到b有一条边，输入范围[0,n-1]*/

indeg[b]++;

mat[a][b]=1;

}

while(top

{

for(i=0;i

if(indeg[i]==0)

{

indeg[i]=-1;

break;

}

j=i;

ans[top++]=j;

for(i=0;i

if(mat[j][i])

mat[j][i]=0,--indeg[i];

}

for(i=0;i

printf(＂%d ＂,ans[i]);

puts(＂＂);

}

课程设计实现拓扑排序算法

#include#include#define MAX_VEXTEX_NUM 20#define M 20#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define OK 1#define ERROR 0typedef int ElemType;typedef struct ArcNode{int adjvex;struct ArcNode *nextarc;}ArcNode;typedef struct VNode{int data;ArcNode *firstarc;}VNode,AdjList[MAX_VEXTEX_NUM];typedef struct{AdjList vertices;int vexnum, arcnum;}ALGraph;typedef struct //构件栈{ElemType *base;ElemType *top;int stacksize;}SqStack;void InitStack(SqStack *)； //函数声明int Pop(SqStack *, ElemType *);void Push(SqStack *,ElemType );int StackEmpty(SqStack *);void CreatGraph(ALGraph *);void FindInDegree(ALGraph , int * );void TopologicalSort(ALGraph );void InitStack(SqStack *S)//初始化栈{S->base=(ElemType *)malloc(STACK_INIT_SIZE*sizeof(ElemType));if(!S->base){printf(＂memory allocation failed, goodbye＂);exit

(1);}S->top=S->base;S->stacksize=STACK_INIT_SIZE;}int Pop(SqStack *S,ElemType *e)//出栈操作{if(S->top==S->base){return ERROR;}*e=*--S->top;//printf(＂%d\n＂,e);// return e;return 0;}void Push(SqStack *S,ElemType e)//进栈操作{if(S->top-S->base>=S->stacksize){S->base = (ElemType *)realloc(S->base,(S->stacksize+STACKINCREMENT)*sizeof(ElemType));if(!S->base){printf(＂memory allocation failed, goodbye＂);exit

(1);}S->top = S->base+S->stacksize;S->stacksize+=STACKINCREMENT;}*S->top++=e;}int StackEmpty(SqStack *S)//判断栈是否为空{if(S->top==S->base)return OK;elsereturn ERROR;}void CreatGraph(ALGraph *G)//构件图{int m, n, i;ArcNode *p;printf（＂请输入顶点数和边数：＂）；scanf(＂%d%d＂,&G->vexnum,&G->arcnum);for (i = 1; ivexnum; i++){G->vertices[i].data = i;G->vertices[i].firstarc = NULL;}for (i = 1; iarcnum; i++) //输入存在边的点集合{printf(＂\n请输入存在边的两个顶点的序号：＂)；scanf(＂%d%d＂,&n,&m);while (nG->vexnum || mG->vexnum){printf（＂输入的顶点序号不正确请重新输入：＂）；scanf(＂%d%d＂,&n,&m);}p = (ArcNode*)malloc(sizeof(ArcNode));if (p == NULL){printf(＂memory allocation failed,goodbey＂);exit

(1);}p->adjvex = m;p->nextarc = G->vertices[n].firstarc;G->vertices[n].firstarc = p;}printf（＂建立的邻接表为：\n＂）； //输出建立好的邻接表for(i = 1; ivexnum; i++){printf(＂%d＂,G->vertices[i].data);for(p = G->vertices[i].firstarc; p; p = p->nextarc)printf(＂%3d＂,p->adjvex);printf(＂\n＂);}}void FindInDegree(ALGraph G, int indegree[])//求入度操作{int i;for (i = 1; inextarc;}}}void TopologicalSort(ALGraph G) //进行拓扑排序{int indegree[M];int i, k, n;int count = 0;ArcNode *p;SqStack S;FindInDegree(G, indegree);InitStack(&S);for (i = 1; iadjvex;if (!(--indegree[k])){Push(&S,k);}}}printf(＂\n＂);if (count