data retrieval information retrieval matching exact partial, best match inference deduction induction model deterministic probabilistic query language artificial natural query specification complete incomplete items wanted matching relevant error response

Document Management, Department of Linguistics, Uppsala University, VT9917

Document Management, Department of Linguistics, Uppsala University, VT9918

SortingThree of many sorting algorithms: selection sort: Look for the biggest element and remove it. Place removed elements in an ordered list until no element is in the original list. bubble sort: Swap neighbors if they are in wrong order until the list is sorted. quick sort: Divide the list in two parts. Ru

n through the two parts and put all elements which are bigger than the chosen value in one part and all elements which are smaller in the other part. Apply the same algorithm to each of the two parts until the list is sorted (best average complexity of n2log(n)).

ReferencesKD94] Bharat Kinariwala and Tep Dobry. Chapter 10, Sorting and Searching. In Programming in C, 1994. Available on http://spectra.eng.hawaii.edu/Courses/EE150/Book/chap10/chap10.html Rij79] C. J. van RIJSBERGEN. Information Retrieval, Second Edition, Department of Computer Science, University of Glasgow, 1979. Available on http://www.dcs.gla.ac.uk/Keith/Preface.html St92] Graham A. Stephen String Search, Technical Report, School of Electronic Engineering Science, University College of North Wales, Gwynedd 1992. Available on http://ei.cs.vt.edu/ cs5604/f95/cs5604cnSS/TR92.html