main.c

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

/* 
 * File:   main.c
 * Author: zephyr
 *
 * Created on July 11, 2016, 9:29 AM
 */


#include <stdio.h>
#include <stdlib.h>
/*

#include "graphic.h"
#include "flody.h"
#include "dijkstra.h"
#include "aov.h"
*/

#include "rank.h"
/*
 * 
 */

void subcall(int *a,int size)
{
    int i;
    for(i = 0;i<size;i++)
    {
        a[i] = i*i;
    }
}


void see_the_test_result()
{
    int a[10];
    int i;
    subcall(&a,10);
    
    printf("\n");
    for(i=0;i<10;i++)
        printf("%5d",a[i]);
    
    printf("\n");
    a == &a ? printf("a==&a[0]") : printf("a != &a[0]");
}

void main() {

//    map g;
//    AdjacentListMap G;
//    Pathmatric P;
//    DistanceTable  D;
//    init_graph(&g,10);
//    get_random_graph(&g,1,30);
//    
//    printf("the original random graph\n");
//    tranverse_graph(&g);
    
//    find_shortest_path_by_floyd(&g,&P,&D);
//    printf("the shorest path matric\n");
//    
//    tranverse_two_matric(&P,10);
//    printf("the distance matric\n");
//    tranverse_two_matric(&D,10);
//    show_shortest_path(&P,&D,1,8);
//    printf("I am executed...[%d]\n",adaptMatricMap2ListMap(&g,&G));
//    tranverseListMap(&G,g.vertex_num);
//    topo_rank(&G,g.vertex_num);
    
    ArrayList list,*l;
    l = &list;
    generate_random_list(l,60);
    printf("the origin list:\n");
    tranverse_arraylist(l,0);
    //SelectSort(l);
    //StraightInsertSort(l);
    //PartSortByStaightInsert(l,1,2);
    //ShellSort(l);
    //MergingSort(l);
    QuickSort(l);
    //HeapSort(l);
    printf("the sort result is %d (0 is wrong,1 is right)\n",TestSortResult(l));
    printf("the sorted list:\n");
    tranverse_arraylist(l,0);
    
    //see_the_test_result();
}