C++博客-★Snowhill ★-随笔分类-data structure

quicksort

snowhill — Sun, 31 Dec 2006 11:55:00 GMT

#include " iostream.h "
void quick_sort( int list[], int left, int right)
{
     int i = left,j = right,temp = list[i];
     while (i < j)
    {
     while ((i < j) && (list[j] > temp)) j --     ;
        list[i] = list[j];
     while ((i < j) && (list[i] <= temp)) i ++ ;
        list[j] = list[i];
    }
    list[i] = temp;
     if (left < i - 1 )quick_sort(list,left,i - 1 );
     if (i + 1 < right)quick_sort(list,i + 1 ,right);
}

snowhill 2006-12-31 19:55 发表评论

插入排序

snowhill — Wed, 27 Dec 2006 14:20:00 GMT

1 #include "iostream.h"
2
3 void insertsort(int a[],int m)
4 {
5         int temp,j;
6
7         for(j=1;j<m;j++)
8         {
9
10             if(a[j-1]>a[j])
11             {
12                 temp=a[j];
13                     for(int i=j-1;a[i]>=temp&&i>=0;i--)
14                     {
15                     a[i+1]=a[i];
16                     }
17                 a[i+1]=temp;
18             }
19         }
20
21
22 }

snowhill 2006-12-27 22:20 发表评论

广度优先搜索

snowhill — Sun, 17 Dec 2006 03:32:00 GMT

广度优先搜索

// date:2006-12-15 by:snowhill
#include " iostream.h "
#define    elemtype int
#define    MAX_VERTEX_NUM   20          // 最大顶点数
#define    MAX_EDGE_NUM   40            // 最大边数
int    visited[MAX_VERTEX_NUM];        // 访问标志数组
struct ArcNode{
     int adjvex;
    ArcNode * NextArc;
};
struct VNode{
    elemtype data;
    ArcNode * firstArc;
};
typedef VNode AdjList[MAX_VERTEX_NUM];
struct ALGraph
{
    AdjList vertices;
     int vexnum,arcnum;
};
ALGraph G;

void CreateDG(ALGraph & G)
{
     int i,j,k;
    ArcNode * p;
    cout << " 创建一个有向图: " << endl;
    cout << " 请输入顶点数: " ;    cin >> G.vexnum; cout << endl;
    cout << " 请输入边数: " ;     cin >> G.arcnum; cout << endl;

     for (i = 1 ;i <= G.vexnum;i ++ )
    {
     G.vertices[i].data = i;
     G.vertices[i].firstArc = NULL;
     }
     for (k = 1 ;k <= G.arcnum;k ++ )
    {
    cout << " 请输入第 " << k << " 条边: " << endl;
    cin >> i >> j;
    p = new ArcNode;
    p -> adjvex = j;
    p -> NextArc = G.vertices[i].firstArc;
    G.vertices[i].firstArc = p;
    }
}
void disp(ALGraph G)
{
     int i;
    ArcNode * p;
    cout << " 建立的图为: " << endl;
     for (i = 1 ;i <= G.vexnum;i ++ )
        {
        p = G.vertices[i].firstArc;
         while (p != NULL)
            {
            cout << " ( " << i << " , " << p -> adjvex << " ) " ;
            p = p -> NextArc;
            }
        cout << endl;
    }
    cout << " ******************************* " << endl;
}
void bfs( int v)
{
  ArcNode * p;
   int queue[MAX_VERTEX_NUM];
   int front = 0 ,rear = 0 ,w;
   for ( int i = 0 ;i <= MAX_VERTEX_NUM;i ++ )
    visited[i] = 0 ;
  cout << v;
  visited[v] = 1 ;
  rear = (rear + 1 ) % MAX_VERTEX_NUM;
  queue[rear] = v;
   while (front != rear)
    {
        front = (front + 1 ) % MAX_VERTEX_NUM;
        w = queue[front];
        p = G.vertices[w].firstArc;
         while (p != NULL)
            {
             if (visited[p -> adjvex] == 0 )
                {visited[p -> adjvex] = 1 ;
                 cout << p -> adjvex;
                 rear = (rear + 1 ) % MAX_VERTEX_NUM;
                 queue[rear] = p -> adjvex;
                 }
            p = p -> NextArc;
        }
    }
}

void main()
{
int v;
CreateDG(G);
disp(G);
cout << " 请输入广度优先遍历的顶点: " ;
cin >> v;  cout << endl;
cout << " 广度优先遍历为: " << endl;
bfs(v);  cout << endl;
}

snowhill 2006-12-17 11:32 发表评论

图的邻接表

snowhill — Sun, 03 Dec 2006 08:42:00 GMT

//DATE:2006-12-03    BY:snowhill
/* 1---2   以邻接表存放应为: 1->5->3->2
    | \ / |       2->4->3->1
    | 3 |       3->5->4->2->1
    | / \ |        4->5->3->2
    5---4       5->4->3->1
*/
/* 图的邻接表以a[1]为起始地起址存放 */
#include "iostream.h"
const int n=5;
const int e=8;
int visited[n+1]; //访问标志数组
struct link
{
int data;
link *next;
};
struct node
{
int v;     //顶点信息
link *next;
}a[n+1];

/* 无向图的建立 */
void createlink()
{
int i,j,k;
link *s;
//初始化
for(i=1;i<=n;i++)
{
a[i].v=i;
a[i].next=NULL;
}

/*以头插法建立 */

for(k=1;k<=e;k++)
{
  cout<<"请输入一条边:";
  cin>>i>>j;
  cout<  s=new link;
  s->data=j;
  s->next=a[i].next;
  a[i].next=s;
  s=new link;
  s->data=i;
  s->next=a[j].next;
  a[j].next=s;
}
}

/* 深度优先搜索 */
void dfs(int i)
{
link *p;
cout< visited[i]=1;
p=a[i].next;
while(p!=NULL)
{
if(!visited[p->data])
dfs(p->data);
p=p->next;
}
}

void main()
{
   link *p;char yn='y';int k;
createlink();
while(yn=='y')
{
  cout<<"你建立的图为:"<  for(int i=1;i<=n;i++)
  {
  p=a[i].next;
  cout<";
  while(p->next!=NULL)
   {
    cout<data<<"->";
    p=p->next;
   }
  cout<data<  }
    for(i=1;i<=n;i++)
visited[i]=0;
cout<<"请输入深度优先搜索的顶点:";
cin>>k;
cout<
dfs(k);
cout<<"要继续遍历吗(Y/N)?";
cin>>yn;
}


}

snowhill 2006-12-03 16:42 发表评论

先序非递归遍历

snowhill — Sun, 03 Dec 2006 01:13:00 GMT

//先序非递归遍历
void preorder(bitree *BST)
{
bitree *p,*s[100];
int top=0;
p=BST;
while((p!=NULL)||(top>0))
{
  while(p!=NULL)
  {
   cout<data<<" "<   s[++top]=p;
    // cout<<"the value of top is "<   p=p->lchild;
  }
   p=s[top--];   //注意TOP值的变化
   // cout<<"*******the value of top is "<   p=p->rchild;
}
}

snowhill 2006-12-03 09:13 发表评论

Binary Tree

snowhill — Sat, 02 Dec 2006 11:31:00 GMT

/* DATE: 2006-12-02 BY:snowhill */

#include "iostream.h"
/* definition */
struct bitree
{
int data;
bitree *lchild,*rchild;
};
//插入
void Insert(bitree *&BST,int x)
{
if(BST==NULL)
{
  bitree *p=new bitree;
  p->data=x;

  p->lchild=p->rchild=NULL;
  BST=p;
}
else if(BST->data>=x)
Insert(BST->lchild,x);
else
  Insert(BST->rchild,x);
}

//create a binary Tree with n nodes

bitree *create(bitree *BST,int n)
{
int x;
BST=NULL;
for(int i=1;i<=n;i++)
{
  cin>>x;
  Insert(BST,x);
}
if(BST==NULL)
  cout<<"It must be fun!"< return BST;

}
//先序遍历
void preorder(bitree *BST)
{
bitree *p;
p=BST;
if(p!=NULL)
{

cout<data<<"->";
preorder(p->lchild);
preorder(p->rchild);
}

}

/* 主函数 */
void main()
{
bitree *BST;
BST=NULL;
BST=create(BST,4);
preorder(BST);

}

snowhill 2006-12-02 19:31 发表评论