Printable View
Hi,
I am interested in implementing parallel sorting algorithms for comparison. They just have to sort a list of integers.
Though I am not very familiar with the whole area, can anyone suggest which parallel algorithms would be best? basically easiest to implement......
would be much appreciated, ty
oh, I already have done o/e and o/e merge sort (i think), just need a few more.
While I am here, I came across the library #include <unistd.h>
anyone know what it is for?
There are lots of functions in it, like stat(), opendir(), and mkdir().Quote:
While I am here, I came across the library #include <unistd.h>
anyone know what it is for?
ahhkay thanks, when I use it thought my compiler is saying unable to open include file unistd.h
is there anywhere I could get this to put it amond my libraries?
What compiler are you using? <unistd.h> is a POSIX function, and some compilers for Windows (or DOS) don't support it.
What do you want to use from it?
Yea I am using borland 5.5 and compiling it in dos. It was just that I had an example program I wanted to run, to see what the output was so I could maybe understand it better, and it included that library. I suppose it isn't that important.
But anyway if anyone has any info on parallel sorting algorithms, that I mentioned in the first post here, it would be great...