I haven't currently run any tests on it, but the performance of the method you suggest varies based on a few factors:
- How your C library implements qsort. C doesn't specify which sorting...
Type: Posts; User: Barney McGrew
I haven't currently run any tests on it, but the performance of the method you suggest varies based on a few factors:
- How your C library implements qsort. C doesn't specify which sorting...
It's probably easier just to use a simple binary tree since they're very easy to implement and they're ideal for this particular task. With an array you need to make define a maximum limit (unless...
Nah. My first suggestion involves writing a C program and my second one involves using a program that does a similar thing in a more generic way. You don't need to write a bash script for either, but...
Store each record into a struct and insert it in an ordered binary tree, then write each record in order.
edit: Or just use "sort -n".