Algorithms for external sorting

Anej Budihna (2015) Algorithms for external sorting. EngD thesis.

Preview

Abstract

The thesis presents the field of external sorting. In the thesis we describe and compare multiple sorting algorithms for external sorting based on their behavior, their advantages and disadvantages. The algorithms we compare are the straight multiway merge sort, balanced multiway merge sort, natural multiway merge sort, polyphase merge sort, cascade sort, distribution sort, funnel sort and two pre-sorting algorithms. The purpose of the thesis is to describe and present how the algorithms work in theory and in practice. We implemented the algorithms in the C programming language and then experimentally compared them on a personal computer with one external storage device.

Item Type:

Thesis (EngD thesis)

Keywords:

sorting, data, algorithms

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
doc. dr. Jurij Mihelič	305	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536605891)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

3152

Date Deposited:

18 Sep 2015 16:47

Last Modified:

29 Oct 2015 09:33

URI:

http://eprints.fri.uni-lj.si/id/eprint/3152

Actions (login required)

View Item