The code segment below nas time complexity? for (int j=0; j

Question 4

Reverse the order of a n-element array in C What am I doing incorrectly and how can I fix? My code: #include <stdio.h> sort(int *p, int m) { //Write your code here for(int i = 0; i<n/2; i++){ temp = arr[i]; arr[i] = arr[n-i-1]; arr[n-i-1] = temp; } } main(){     int i, n;     int *p, num[20];     printf("input n:");     scanf("%d", &n);     printf("please input these numbers:\n");     for (i = 0; i < n; i++)         scanf("%d", &num[i]);     p = &num[0];     sort(p, n);     printf("Now, the sequence is:\n");     for (i = 0; i < n; i++)         printf("%d ", num[i]); }

Provide the program in C language for the pseudocode given below.

Write a parallel program for the following code   /* PROGRAM Sieve */ #include <stdlib.h> #include <math.h> #define n 100 boolean Prime[n+1]; int i,num,loc; main( ) { for (i = 1; i <= n; i++) Prime[i] = TRUE; for (num = 2; num <= Sqrt(n); num++) if (Prime[num]) { loc = num + num; while (loc <= n) { Prime[loc] = False; } } loc = loc + num; }