-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathREADME
More file actions
19 lines (13 loc) · 711 Bytes
/
README
File metadata and controls
19 lines (13 loc) · 711 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
Tweaksort is a super fast composite sorting algorithm, which adapts itsself to the data
being sorted.
The paper I wrote is in a tex file, images in folder slike/, pdf version is also
avaliable.
The code of the project is in code/ folder, obviously. There is all the code I wrote, not
a nice selection. Only nice code is located in nice/ folder.
Main sorting algorithms are quicksort, heapsort, selection sort, insertion sort, and merge
sort.
They are composited in a composite tweaksort, based on experimental data, all of that
happening in learn.cpp
The only files you need if you want to try the project out are located in the libtweaksort
folder. All 4 files are needed, but nothing else is.
Jure Slak