Sorting dan Searching
Sorting adalah proses pengurutan data sedangkan searching adalah proses pencarian data yang diinginkan. Simple Sorting: - Bubble Sort - Selection Sort - Insertion Sort Intermediate Sorting: - Quick Sort - Merge Sort Sorting: Bubble Sort: void Bubble(int *DataArr, int n) { int i, j; for(i=1; i<n; i++) for(j=n-1; j>=i; j--) if(DataArr[j-1] > DataArr[j]) Swap(&DataArr[j-1],&DataArr[j]); } Selection Sort: for(i=0; i<N-1; i++){ Set idx_smallest equal to i for(j=i+1; j<N; j++){ If array[ j ] < array [ idx_smallest ] then idx_smallest = j } Swap array[ i ] with array[ idx_smallest ] } Insertion Sort: for(i=1; i<n; i++) { x = A[i]; } Quick Sort: void QuickSort(int left, int right) { if(left < r...