No more giving back...

For unsigned INTs radix sort is the best.

http://board.flatassembler.net/topic.php?t=5081&postdays=0&postorder=asc&start=20

The linked thread has the code I put together, I think it's still the fastest implementation available.

For unsigned ints - and in-place sorting, heap sort with some tweaks can make it very fast. Faster than Quicksort up to a certain limit.

No more giving back...

Random number generator?

Just read /dev/random or /dev/urandom , depending on how random you want it

No more giving back...

mmap() by itself is not enough to load a shared library - but mmap() is used in the process, just like it's used on windows to load PE executables (and DLLs).

As far as I've been able to tell, the linux kernel itself doesn't have all the code to load shared libraries - as of recent (last N years) part of the stuff is implemented in (g)libc and ld.so... and you really probably are best off sticking with dlopen()/dlsym()/dlclose().

Linux is pretty different from Windows

Super scalar sample sort should be pretty fast at least way faster than heap sort with guaranteed O(n log n)

see for example
http://rw4.cs.uni-sb.de/~sewi/ssss.pdf

No more giving back...

If you are trying to load a shared library in linux, then im afraid its linker, or ugly hack (although the ugly hack will probably simply be emulating the actions of a linker in one way or another).

If you want to keep the binaries pure, dont use external shared libraries (usually written in C anyway), and simply use Format ELF Executable.