Sorting Sort Test" program

Program 2 demonstrates how fast Ultrasort is. To watch the demonstration, load and run Ultrasort. Then load and run "Sort Test" (Program 2). One hundred random strings will be created, and after you press a key, they will be sorted and listed. The time required for the sort is displayed at the end of the list. To change the number of strings created, change the variable N in line 110 of Program 2. 

All formulas are to be written out by hand with the specific numbers in the right places on a sheet provided for the purpose, and the calculations are to be done by calculator. Caution Write the numbers exactly as printed, do not round any digits, or the quality assurance unit (a sort of corporate vice squad) will not approve the report out of fear that someone could have cheated. A validated program can be used. While an Excel spreadsheet as such needs no validation, a simple cell-formula calls for extensive tests and documentation and proof that the sheet is password protected against fraudulent manipulation. On top of that, the analyst s supervisor is required to confirm the calculation and sign off on... 

When evaluating individuals abilities to perform technical or physical skills, you may wonder whether it is wise to have them take a test of some sort. Unfortunately, tests can be legally problematic unless they have been determined to be both reliable and internally valid. Other than the standard keyboarding program tests for positions that require typing or data entry skills, grammar and spelling tests, and basic math tests, there are few validated tests available in the marketplace. 

This is one of the fastest sorting programs ever published for any home computer. It will alphabetize 1000 items in less than eight seconds. The test generates random "words" so you can see how the program works. 

Another way to view similarity between 3-D structures is to focus on the pharmacophore atoms and the direction, or points, of their interaction with a target protein. The program FAMILY (142) assigns 3-D structures to families of compounds in which the variation in all distances between the points of interest are within a specified tolerance, usually 0.3-0.5 A. FAMILY uses the Bron-Kerbosh clique detection algorithm (143,144) to find these common 3-D substructures, and is rapid in execution since a typical test found that 384 compounds could be matched over seven points in under a minute on a VAX 9000. The points that are considered in the analysis are selected in an initial run of ALADDIN, and are typically the pharmacophore atoms and all heavy atoms that are attached to them. In a classification of dopaminergics, the atoms attached to these attached atoms were also used to increase the number of families found. In this example of compounds that met the pharmacophore requirements, it was shown that the set of computer-designed compounds (97) sorted itself into 36 families whereas compounds in a definitive review (145) sorted themselves into 15 families. 

---