Example Algorithm for Linear Search

For each item in the list.
  Check to see if the item your looking for matches the item in the list.
    If it matches.
      Return where you found it (the index).
    If it does not match.
      Continue searching until you reach the end of the list.

Here we know the item does not exist in the list, return -1.



Example Algorithm for Binary Search (from Wikipedia.org)

function binarySearch(a, value, left, right)
    while left �� right
        mid := floor((left+right)/2)
        if value > a[mid]
            left  := mid+1
        else if value < a[mid]
            right := mid-1
        else
            return mid
    return not found
	
Example Algorithm for Bubble Sort

function bubble_sort(list L, number listsize)
    loop
        has_swapped := 0 //reset flag
        for number i from 1 to (listsize - 1)
            if L[i] > L[i + 1] //if they are in the wrong order
                swap(L[i], L[i + 1]) //exchange them
                has_swapped := 1 //we have swapped at least once, list may not be sorted yet
            endif
        endfor
        //if no swaps were made during this pass, the list has been sorted
        if has_swapped = 0
            exit
        endif
    endloop
endfunction
	
	
Example Algorithm for Selection Sort

find the minimum value in the list
swap it with the value in the first position
sort the remainder of the list (excluding the first value)