#include #include #define NUM_ITEMS 1000 void bubbleSort(int numbers[],int array_size);int numbers[NUM_ITEMS];int counter;int main(){
[...]
| ||||||
#include #include #define NUM_ITEMS 100 void heapSort(int numbers[],int array_size);void siftDown(int numbers[],int root,int bottom);int numbers[NUM_ITEMS];int counter;int main(){int i;//seed random number generator srand(getpid());//fill array with random integers for (i = 0;i < NUM_ITEMS;i++) numbers[i] = rand();heapSort(numbers,NUM_ITEMS);//perform heap sort on array for [...] #include #include #define NUM_ITEMS 500 void selectionSort(int numbers[],int array_size);int numbers[NUM_ITEMS];int counter;int main(){int i;//seed random number generator srand(getpid());//fill array with random integers for (i = 0;i < NUM_ITEMS;i++) numbers[i] = rand();//selectionData(numbers,NUM_ITEMS);//perform selection sort on array //counter=0;selectionSort(numbers,NUM_ITEMS);//perform selection sort on array for (i [...] #include #include #define NUM_ITEMS 100 void insertionSort(int numbers[],int array_size);int numbers[NUM_ITEMS];int counter;int main(){int i;//seed random number generator srand(getpid());//fill array with random integers for (i = 0;i < NUM_ITEMS;i++) numbers[i] = rand();insertionSort(numbers,NUM_ITEMS);//perform insertion sort on array for (i = 0;i < NUM_ITEMS;i++) [...] #include #include #define NUM_ITEMS 100 void mergeSort(int numbers[],int temp[],int array_size);void m_sort(int numbers[],int temp[],int left,int right);void merge(int numbers[],int temp[],int left,int mid,int right);int numbers[NUM_ITEMS];int temp[NUM_ITEMS];int counter;int main(){int i;//seed random number generator srand(getpid());//fill array with random integers for (i [...] | ||||||
| Copyright ©2012 Ilmu Komputer - All Rights Reserved | ||||||