Complexity (compare): O( )
Complexity in worst case (compare): O( )
Complexity in average case (compare): O( )
Complexity in best case (swap): O(1)
Complexity: O( )
Procedure Look_up(node n_r, label x):
Complexity: O( )
Procedure 8_queen(int nqueen, boolean board[8][8] )
Procedure move(int n_rings, peg from, peg to, peg over):
Complexity: O( )
Procedure void quicksort(array numbers, int lo, int hi )
Complexity (average): O( )
Pr
Main pr
Y ind a C pr
1. /users/faculty/hpbischo/221/Src/perm.c 2. /users/faculty/hpbischo/221/Src/knapsack.c
A difficult alg
Newtons algorithmn: find x such that f(x) = 0.
The algorithmn as a Nassi Shneidermann diagram:
find(x) as a Nassi Shneidermann diagram:
Procedure find(real x)
Beware of f'(x) == 0.
Last modified: 27/July/98 (12:14)