// run simulation using a randomly generated initial schooling // configuration. Collect statistics. // N, r, and numFrames are input // elongation and polarization are output. void runRandomSimulationWithStatistics( int N, float r, int numFrames, float *elongation, float *polarization, float attr) { //randomize init values: float *Px = createRandomArray(0,5,N); float *Py = createRandomArray(0,5,N); float *Vx = createRandomArray(0,5,N); float *Vy = createRandomArray(0,5,N); runSimulationWithStatistics(Px, Py, Vx, Vy, N, r, numFrames,elongation,polarization,attr); } // end runRandomSimulationWithStatistics
int main(void) { int size = 25; int* a = malloc(sizeof(int) * size); int* temp = malloc(sizeof(int) * size); printf("----> 1D Array Sorting <----\n\n"); printf("insertionSort\n"); createRandomArray(a, size); printArray(a, size); insertionSort(a, size); printArray(a, size); printf("\n"); printf("selectionSort\n"); createRandomArray(a, size); printArray(a, size); selectionSort(a, size); printArray(a, size); printf("\n"); printf("mergeSort\n"); createRandomArray(a, size); printArray(a, size); mergeSort(a, size, temp); printArray(a, size); printf("\n"); printf("quickSort\n"); createRandomArray(a, size); printArray(a, size); quickSort(a, 0, size-1); printArray(a, size); printf("\n"); printf("----> 2D Array Sorting <----\n\n"); int rows = 5, cols = 5; int** a2D = malloc(sizeof(int*) * rows); int i; for(i = 0; i < rows; i++) { a2D[i] = malloc(sizeof(int) * cols); } printf("insertionSort\n"); createRandom2DArray(a2D, cols, size); printArray2D(a2D, rows, cols); insertionSort2D(a2D, cols, size); printArray2D(a2D, rows, cols); printf("\n"); return EXIT_SUCCESS; }
int main(int argc, const char * argv[]) { int * arr; int * res; int i; for(i = 0; i < 11; i++) { arr = createRandomArray(i); res = createRandomArray(i); printArray(arr, i); countingSort(arr, res, i, BOUND); printArray(res, i); printf("isSorted: %d\n", isSorted(res, i)); printf("---------------------------\n"); free(arr); free(res); } return 0; }
int main(int argc, const char * argv[]) { int size, k, val, valAfterSorting; int * arr; for(size = 1; size < 11; size++) { arr = createRandomArray(size); printArray(arr, size); k = randMinMax(0, size-1); val = selectKthOrder(arr, 0, size-1, k); printArray(arr, size); printf("k: %d, val: %d\n", k, val); quickSort(arr,0, size-1); valAfterSorting = arr[k]; printArray(arr, size); printf("arr[k]: %d\n", valAfterSorting); printf("isSame: %d\n", isSame(val, valAfterSorting)); free(arr); printf("-------------------------------------\n"); } return 0; }
void test(){ int length = 10; int* array = createRandomArray(length, -10, 10); print(array, length); delete [] array; }