Download presentation
Presentation is loading. Please wait.
1
General Computer Science for Engineers CISC 106 James Atlas Computer and Information Sciences 10/21/2009
2
Objectives Overview of Sorting Algorithms Understand Selection Sort
3
Why do we sort data?
4
How do we sort data?
5
Algorithm for sorting (Selection Sort) 1. Find the minimum data in the set 2. Swap it with the first element of the set 3. Repeat Steps 1-2 for the remaining elements
6
10843125769 1843 25769 1243 85769 1234 85769 1234 85769 123458 769 123456 789 1234567 89 12345678 9 123456789 Running Time (Selection Sort) loop progress
7
Structures student.name = ‘Frank’ student.birthday = 22 disp(student) student = struct(‘name’,’Frank’,’birthday’,22)
8
Project 1 A system of bouncing circles (simulation) Part 1 - elastic collision with a wall Teams - 3-5 people (smaller is better) ◦ Librarian ◦ Recorder ◦ Team Leader ◦ Name! Need team participants by Friday
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.