2015Unpublished venueRequires access

Algorithms for external sorting

Anej Budihna

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Sorting algorithm, Merge sort, sort, Merge algorithm, Computer science, Merge (version control), Sorting, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Algorithms for external sorting — Research Paper | ScholarLens