| The Beta Sweep |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| By
abstracting we can analyze parts of |
|||||||||||||||
| an
algorithm … |
|||||||||||||||
| * | The beta sweep has 4 properties: |
||||||||||||||
| • | Exhaustive -- it considers all CDs after alpha |
||||||||||||||
| • | Non-redundant -- no slot pair is checked twice |
||||||||||||||
| • | Progressive -- the alphabetically earliest CD |
||||||||||||||
| considered so far is always in the alpha slot |
|||||||||||||||
| • | Effective -- at completion, the alphabetically |
||||||||||||||
| earliest CD from alpha to end is in alpha slot |
|||||||||||||||
| These
properties apply only to Alphabetize CDs |