Com S 280 - Algorithms, Integers, Matrices

Com S 280 - Algorithms, Integers, Matrices - Algorithms...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Algorithms, Integers, Matrices - Definitions o algorithm: a finite set of precise instructions for performing computation or solving a problem o searching algorithm: the problem of locating an element in a list o linear search algorithm : a procedure for searching a list element by element o binary search algorithm: a procedure for searching an ordered list by successively splitting the list in half o sorting: the reordering of elements of a list into nondecreasing order o greedy algorithm: an algorithm that makes the best choice at each step o )) ( ( ) ( x g O is x f : The fact that ) ( ) ( x g C x f for all k x for some constants C and k o witness to the relationship )) ( ( ) ( x g O is x f : a pair C and k such that ) ( ) ( x g C x f whenever k x o )) ( ( ) ( x g is x f : The fact that ) ( ) ( x g C x f for all k x for some constants C and k o )) ( ( ) ( x g is x f Θ The fact that ) ( x f is ) ( ) ( x and x O o time complexity: the amount of time required for an algorithm to solve a problem o space complexity: the amount of storage space required for an algorithm to solve a problem
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/14/2008 for the course CS 2800 taught by Professor Selman during the Fall '07 term at Cornell.

Page1 / 2

Com S 280 - Algorithms, Integers, Matrices - Algorithms...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online