anchitjain1234 / Parallel-Merge-Sort

Merge Sort by creating different processes to sort and merge.

Parallel Merge Sort

Merge sort by creating child processes using fork bomb to sort the inputs and then merging the sorted output by child processes in parent process.

Compiling

Type the following command to generate a binary named merge

$ make

Running

• Generate a file input.txt having integers to be sorted , one per line with first line having total numbers to be sorted.Example input file:-
  5
  10
  8
  9
  6
  7
  1^st line tells 5 integers are to be sorted.
  Next 5 lines contain innteger to be sorted, one every line.

• Run the program by following command.This will give sorted result on the standard output.

   $ ./merge

Todos

• If no more processes could be created (all PID's have been used) this program couldn't sort yet.Need to improve upon this.