Menu

Tree [acd942] master /
 History

HTTPS access


File Date Author Commit
 AUTHORS 2014-06-16 login-denied login-denied [65d65f] initial import
 COPYING 2014-06-16 login-denied login-denied [14eeef] moved from gpl_v2.txt
 ChangeLog 2015-02-10 login-denied login-denied [3599c5] changed
 INSTALL 2014-06-16 login-denied login-denied [dad56a] initial import
 Makefile.am 2014-06-16 login-denied login-denied [4077bb] initial Import
 Makefile.in 2014-06-16 login-denied login-denied [aea0aa] initial Import
 NEWS 2015-02-24 login-denied login-denied [acd942] news changed
 README 2015-02-10 login-denied login-denied [65a27c] corrected version
 aclocal.m4 2014-06-16 login-denied login-denied [b5947f] initial Import
 algorithm.txt 2015-02-10 login-denied login-denied [dfcb6d] corrected
 challenge.c 2014-06-16 login-denied login-denied [202d56] moved from challange.c
 configure 2014-06-16 login-denied login-denied [505d21] initial import
 configure.in 2014-06-16 login-denied login-denied [f10127] initial Import
 depcomp 2014-06-16 login-denied login-denied [f674c5] import
 ginors.h 2014-06-16 login-denied login-denied [72300c] moved
 ginors_sort.c 2014-06-16 login-denied login-denied [7a6a69] moved from sort_test.c
 install-sh 2014-06-16 login-denied login-denied [c958b0] import
 libginors.c 2014-06-16 login-denied login-denied [58d0c2] moved from ginors_sort.c
 missing 2014-06-16 login-denied login-denied [001706] import

Read Me

README
======

ginors_sort is an implementation of radix sort. See algorithm.txt for more
informations.
The structure of the data to be sorted have to look like:

struct {
       unsigned (char/short/int/long) key;
       [...]
}

the algorithm assumes that the key ist a bitpattern (e.g. unsigned integer)
which has to be sorted in ascending order (little-endian for now). In the
current implementation the struct has to begin with the key.

compilation:
------------
switch to the source code folder and type:

make

this should compile three files:

* libginors.a: library with the sorting function. You can use it in your own
  code.

* ginors_sort: Tool for testing purpose.

* challange: A tool to compare the speed between ginors sort and the standard
  "qsort" libc-function

ginors_sort:
------------

> ginors_sort -m MODE -s SIZE INPUT OUTPUT

where MODE is char/short/int/long (default: char) and SIZE is the size of your
data in bytes (default: 1).
If you want to sort e.g. the characters of the GPL type:

> ginors_sort -m char -s 1 gpl_v2.txt gpl_v2.txt.sort

or simply:

> ginors_sort gpl_v2.txt gpl_v2.txt.sort

The data size may not be smaller than the key size, e.g.:

> ginors_sort -m long -s 3 mydata mydata.sort
warning: object size: 4; key size: 3
warning: object size adjusted to key size

challange:
----------
Uses the same command line parameters as ginors_sort.
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.