Discrete Math and Algorithms Home Work(3)

Hello! BEFORE BIDDING ON THIS PROJECT, PLEASE LOOK AT THE PROBLEMS. THEY ARE HARD. PLEASE DO NOT BID ON THIS WORK WITHOUT LOOKING AT THE PROBLEMS. A more detailed explanation of the problems is attached; one file, with scans from the text book which are below the problems. 2.1: Problem 1.23, page 63 The *median* of an ordered set is an element such that the number of elements less than the median is within one of the number that are greater, assuming no ties. 2.2: Problem 1.24, page 63 Write an algorithm to find the second largest element in a set containing *n* entries. How many comparisons of elements does your algorithm do in the worst case? 2.3: (This third problem is not in our text.) Use induction to prove that: Every binary tree with n internal nodes can have at most n + 1 external node. ## Deliverables I want a word document delivered. * * *This broadcast message was sent to all bidders on Wednesday Sep 20, 2006 4:06:08 PM: I updated the attached files. ## Platform I want a word document delivered.