Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
18BCE2182 MIDTERM PART-B CRITICAL
//gcc 7.4.0 #include <stdio.h> #include <stdlib.h> #include <omp.h> int main(void) { int max, min, n; max = 0; min = 9999; n = 10; int arr[]={10,25,37,96,81,43,55,64,79,110}; for(int i=0; i<n; i++) { printf("%d,\t",arr[i]); } printf("\n"); #pragma omp parallel { for(int i=0; i<n; i++) { #pragma omp critical { if(arr[i]>max) { max=arr[i]; } } } for(int i=0; i<n; i++) { #pragma omp critical { if(arr[i]<min) { min=arr[i]; } } } printf("Max of array: %d\n",max); printf("Min of array: %d\n",min); } return 0; }
run
|
edit
|
history
|
help
0
alphabet2 pyramid right
Bitwise Xor Swaping Two Variables
abc.c
problem4 review fundamentos
18BCE2182 ASSESS_3 Q4
SumIt
recurtion
funcion dar vuelta numero
Finding power using recursion
Spring 2017 Project 2 v1.1