Problem

1. Give an O(n) algorithm to sort an array of n bytes (numbers between -128 and 127).

2. You are given a sequence of arrays of words, representing the pages of a book. Your task is to build an index (a sorted array of words), each element of which has an array of sorted numbers representing the pages on which the word appears. Describe an algorithm for building the index and give its big-Oh running time in terms of the total number of words.