|
[x]
Posted via EE Mobile
|
||
Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again. |
||
| Question |
|
[x]
Attachment Details
|
||
|
[x]
The Solution Rating System
|
||
With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
Your Input Matters If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
||
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: 48: 49: 50: 51: 52: 53: 54: 55: |
#include <stdio.h>
#include "functions.h"
int main()
{
int pid1, pid2;
int arr1[248], arr2[248], grid[496] i, j;
FILE *fp;
fp = fopen("unsorted.txt", "r");
if(fp == NULL)
{
printf("An error has occured during reading the file. Check if the file name or path is correct.\n");
}
pid1=fork();
if(pid1==0)
{
pid2=fork();
if(pid2==0)
{
//SECOND CHILD
heapSort(arr1, 248); //PROBLEM IS HERE: arr1 is not filled though it was, by Parent process.
printArray(arr1,248);
}
else
{
//FIRST CHILD
wait(&pid2);
heapsort(arr2,248);
printArray(arr2,248);
}
}
else
{
while(fscanf(fp, "%d", &grid[count]) != EOF)
{
count++;
}
for(i=0; i<248; i++)
{
arr1[i]=grid[i];
}
i=0;
for(j=248; j<496; j++)
{
arr2[i]=grid[j];
i++;
}
wait(&pid1);
fclose(fp);
}
}
|
Advertisement
| Hall of Fame |