Discrete Math and Algorithms Home Work(2)

已取消 已发布的 Sep 20, 2006 货到付款
已取消 货到付款

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.

## Platform

I want a word document delivered.

工程 MySQL PHP 软件构架 软件测试 网络主机 网站管理 网站测试

项目ID: #3809064

关于项目

4个方案 远程项目 活跃的Sep 20, 2006

有4名威客正在参与此工作的竞标,均价$52/小时

dmitritvw

See private message.

$38.25 USD 在3天内
(115条评论)
5.5
medix

See private message.

$63.75 USD 在3天内
(75条评论)
5.2
vw988650vw

See private message.

$63.75 USD 在3天内
(33条评论)
5.2
shevaknu

See private message.

$40.8 USD 在3天内
(7条评论)
2.6