Algorithm Design

Given a pile of N nuts and N bolts of assorted sizes, give an algorithm to pair the matching nuts and bolts, and print them (ex. Bolt 2 matches Nut 5). Note that some bolts could be larger than can fit the largest nut and/or some bolts could be smaller than can match the smallest nut. The algorithm should use the minimum number of inspections. An inspection involves picking a bolt and a nut and checking to see if they match. Assume that the sizes (radii) are given in arrays Nuts [O.. N- 1] and Bolts [0 .. N 11. Derive the complexity