/* Add Sorted: See Astrachan(1st) p 392 and pp 366-367 (2nd) */
// add at end (unsorted)	// shift to make room and add (sorted)

myList[myCount] = word;		loc = myCount - 1;   // shift structs right
myCount++;        		while (0 <= loc && word < myList[loc])
        			{
        			    myList[loc+1] = myList[loc];
        			    loc--;
        			}
        			myList[loc+1] = word;
        			myCount++;