Skip to content
Snippets Groups Projects
Commit 95d6ac70 authored by mfikrin's avatar mfikrin
Browse files

fix : double print final result

parent 8795ba4f
Branches
No related merge requests found
No preview for this file type
......@@ -345,19 +345,6 @@ int main() {
// --------------------------- End Create the datatype ----------------------------- //
// Distribusi matriks input ke process-process
/*
0 1 2 3 4 5 6 7 8 9
0 1 2
3 4 5
6 7 8
9 10 11
*/
int root = 0;
int divide = num_targets/(world_size-1);
......@@ -409,13 +396,9 @@ int main() {
// Allocate a buffer to hold the incoming numbers
int* number_buf = (int*)malloc(sizeof(int) * number_amount);
MPI_Recv(number_buf, number_amount, MPI_INT, i, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
printf("\nPROCESS 0 IN RECEIVING\n");
print_array(number_buf,number_amount);
//[3]
//[46]
//[22]
for (int j=0; j<number_amount; j++){
arr_range[idxArrRange] = number_buf[j];
......@@ -423,6 +406,27 @@ int main() {
}
}
}
// sort the data range array
printf("BAWAHNYA PRINT ARRAY\n");
print_array(arr_range,num_targets);
merge_sort(arr_range, 0, num_targets - 1);
printf("AFTER SORT\n");
print_array(arr_range,num_targets);
int median = get_median(arr_range, num_targets);
int floored_mean = get_floored_mean(arr_range, num_targets);
// print the min, max, median, and floored mean of data range array
printf("HASIL FINALLLL\n");
printf("MIN : %d\nMAX : %d\nMedian : %d\nRata-Rata : %d\n",
arr_range[0],
arr_range[num_targets - 1],
median,
floored_mean);
} else {
Matrix kernel_recv;
MPI_Recv(&kernel_recv, 1, mat_MPI, root, 0, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
......@@ -520,41 +524,29 @@ int main() {
// }
// }
printf("HOOOOOOOOOOOOOOO\n");
MPI_Finalize();
// // sort the data range array
// printf("BAWAHNYA PRINT ARRAY\n");
// print_array(arr_range,num_targets);
// Print hasil
// for (int i = 0; i < num_targets; i++) {
// printf("\nMATRIX CONV %d",i);
// print_matrix(arr_mat2);
// }
// sort the data range array
printf("BAWAHNYA PRINT ARRAY\n");
print_array(arr_range,num_targets);
merge_sort(arr_range, 0, num_targets - 1);
// merge_sort(arr_range, 0, num_targets - 1);
printf("AFTER SORT\n");
print_array(arr_range,num_targets);
// printf("AFTER SORT\n");
// print_array(arr_range,num_targets);
int median = get_median(arr_range, num_targets);
int floored_mean = get_floored_mean(arr_range, num_targets);
// int median = get_median(arr_range, num_targets);
// int floored_mean = get_floored_mean(arr_range, num_targets);
// // int floored_mean = 10;
// print the min, max, median, and floored mean of data range array
printf("HASIL FINALLLL\n");
printf("MIN : %d\nMAX : %d\nMedian : %d\nRata-Rata : %d\n",
arr_range[0],
arr_range[num_targets - 1],
median,
floored_mean);
// // print the min, max, median, and floored mean of data range array
// printf("HASIL FINALLLL\n");
// printf("MIN : %d\nMAX : %d\nMedian : %d\nRata-Rata : %d\n",
// arr_range[0],
// arr_range[num_targets - 1],
// median,
// floored_mean);
// START OPEN MP
// // START OPEN MP
MPI_Finalize();
return 0;
}
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment