Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
I/O-algorithms Spring 2008Project 1 --I/O-efficient merge-sort The goal of this project is to implement and experiment with I/O-efficient merge-sort using several
 

Summary: I/O-algorithms Spring 2008Project 1 -- I/O-efficient merge-sort
The goal of this project is to implement and experiment with I/O-efficient merge-sort using several
different ways of manipulating streams of data to/from disk. The project should be done in groups
of 34 people and programmed in C or C++ on a Unix system. An important part of the project
is to write a report that describes the implementation and (especially) the experimental work; The
report (including a pointer to the implementation) should be handed in by Tuesday March 13,
2008. The evaluation of the implementation, experimentation and the report will be part of the
final grade.
Part of the project will use a Heap, as well as Heapsort and Quicksort. Use the code from the
following book for these
Robert Sedgewick: Algorithms in C, Parts 14, third edition. Addison-Wesley, 1998,
ISBN 0201314525.
This code can also be found online at
www.cs.princeton.edu/~rs/Algs3.c1-4/code.txt .
Tasks:
1. The implementation of Merge-sort should use the concept of streams. There should be two
different kinds of streams: input streams and output streams. An input stream should at least
support the operations open (open an existing stream for reading), read next (read the next
element from the stream), and end of stream (return true if the end of the stream has been
reached). An output stream should support the operations create (create a new stream),

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

 

Collections: Computer Technologies and Information Sciences