This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n distinct numbers and a positive integer k , determines the k numbers in S that are closest to the median of S . Problem 3. Assume you have an undirected graph, with n vertices and m edges, stored in the adjacency list representation. Then each undirected edge ( x,y ) is stored twice (once on x ’s list of edges and once on y ’s list of edges). Give an e±cient algorithm to make the two occurences of each edge point to each other (assuming initially they do not)....
View
Full
Document
This note was uploaded on 12/02/2010 for the course CMSC 351 taught by Professor Staff during the Spring '07 term at Maryland.
 Spring '07
 staff

Click to edit the document details