alg - • Identify the smallest number • Swap the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
An example of an algorithm would be a sorting algorithm. Input: a list of elements Output: the same list of elements in sorted order (e.g. in case of numbers, from smallest to largest) Application: for instance, searching for a record can be made efficient if elements are sorted One possible sorting algorithm works as follows (assume we are dealing with numbers):
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: • Identify the smallest number • Swap the smallest number with the first number • Repeat with the first number removed from list Here's an illustration: 2 8 7 1 3 5 6 4 1 8 7 2 3 5 6 4 1 2 7 8 3 5 6 4 1 2 3 8 7 5 6 4 1 2 3 4 7 5 6 8 1 2 3 4 5 7 6 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8...
View Full Document

This note was uploaded on 03/27/2010 for the course CSCI 120 taught by Professor Saadmneimneh during the Spring '09 term at CUNY Hunter.

Ask a homework question - tutors are online