# 2 - For each algorithm make sure you write out the...

This preview shows pages 1–5. Sign up to view the full content.

CSCE 350: Data Structures and Algorithms Spring 2010 Homework 2 Solution 02/10/10 1. (0.5 points) Problem 2.1.8. b, d, f. 2. (0.5 points) Problem 2.1.9. For this problem you don’t need to explain your answer. 3. (0.5 points) Problem 2.2.3. a, b, d.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4. (0.5 points) Problem 2.2.5. 5. (0.5 points) Problem 2.3.1. a, c, e. 6. (0.5 points) Problem 2.3.6.
7. (0.5 points) Problem 2.4.1. b, c, d.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
8. (0.5 points) Problem 2.4.4.
9. (1 point) Apply the following algorithms to sort the list H , O , M , E , W , O , R , K in alphabetical order: (a) Selection Sort; (b) Bubble Sort;
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: For each algorithm, make sure you write out the intermediate steps in order to get the points. (a) Selection Sort: H O M E W O R K E | O M H W O R K E H | M O W O R K E H K | O W O R M E H K M | W O R O E H K M O | W R O E H K M O O | R W E H K M O O R | W (b) Bubble Sort: H O M E W O R K H M O E W O R K H M E O W O R K H M E O O W R K H M E O O R W K H M E O O R K | W H M E O O R K W H E M O O R K W H E M O O K | R W H E M O O K R W E H M O O K R W E H M O K | O R W E H M O K O R W E H M K | O O R W E H M K O O R W E H K | M O O R W...
View Full Document

## This note was uploaded on 06/11/2011 for the course CSCE 350 taught by Professor Staff during the Spring '08 term at Columbia SC.

### Page1 / 5

2 - For each algorithm make sure you write out the...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online