COMP 14 Introduction to Programming

1. COMP 14Introduction to Programming Adrian Ilie July 19, 2005

2. Today • Review arrays • Searching arrays for a particular value • Sorting arrays

3. 0 1 2 3 Exercises 1. Find Sum and Average of Array 2. Determine Largest and SmallestElements in Array

4. 0 1 2 3 Example Find Sum and Average of Array double[] sale={3.5, 4.6, 5.2, 3.8}; doublesum = 0; double average;

5. 0 1 2 3 Example Find Sum and Average of Array double[] sale={3.5, 4.6, 5.2, 3.8}; doublesum = 0; for(int ind = 0; ind < sale.length; ind++) { sum = sum + sale[ind]; } double average; if(sale.length != 0) average = sum/ sale.length; else average = 0.0;

6. 0 1 2 3 Example Determining Largest/Smallest Element in Array double[] sale={3.5, 4.6, 5.2, 3.8}; intmaxIndex = 0, minIndex =0; doublelargestSale; doublesmallestSale;

7. 0 1 2 3 Example Determining Largest/Smallest Element in Array double[] sale={3.5, 4.6, 5.2, 3.8}; intmaxIndex = 0, minIndex = 0; for (int ind = 1; ind < sale.length; ind++) { if (sale[ind] > sale[maxIndex]) maxIndex = ind; else if (sale[ind] < sale[minIndex]) minIndex = ind; } doublelargestSale = sale[maxIndex]; doublesmallestSale = sale[minIndex];

8. Searching Arrays • Find one/several particular element(s) in an array of many elements • Complexity (How Long To Search?) • find a parking space - linear • look up a word in a dictionary - complex 500K+ words in Oxford Dictionary search - very complex over 3 trillion web pages

9. Time Complexity • Important feature in Computer Science research: • How long does an algorithm take to complete? • Given an input (e.g. an array) of size n, how long does it take for the algorithm (e.g. search for a particular value) to complete? • Linear algorithm: time = k1 * n • Quadratic algorithm: time = k2 * n2 • etc.

10. Linear Searching • Algorithm: • Get a test value and a list of values • list can be ordered or unordered • loop through the list • repeatedly ask: Is this a match? • quit when the answer is yes (use break statement) • if you finish all items, there is no match • Inefficient • worst time to search is the length of the list • Relatively easy to program

11. 0 1 2 3 Example Linear Search int[] list={3, 6, 27, 8, 33, 54, 23}; intfoundAt = -1, element = 33;

12. 0 1 2 3 Example Linear Search int[] list={3, 6, 27, 8, 33, 54, 23}; intfoundAt = -1, element = 33; for(inti=0; i<list.length; i++) { if(list[i] == element) { foundAt = i; break; }}

13. Array of Objects • Declare array of Student objects (ref. variables) • Instantiate array of size 10 • Instantiate each of the Student objects • Ask for age (int) and name (String) • Instantiate object

14. 0 1 2 3 Example Array of Student objects Student[] students; students =newStudent[10]; for(inti = 1; i < students.length; i++) { //getintage //get String name students[i]=newStudent(name, age); }

15. 0 1 2 3 Example Search for student Mark int foundAt=-1; String name=“Mark”; for(inti = 0; i < students.length; i++) { if(students[i].getName().equals(name)) { fountAt=i; break; } }

16. Binary Search • Requires ordered (sorted) list • Set searchRange to the entire list • Repeat: • pick a “test value” in the middle of searchRange • if test value == value searching for • Stop! • if test value > value searching for • searchRange = lower half of searchRange • if test value < value searching for • searchRange = upper half of searchRange

17. Trial 1 2 4 5 12 16 19 22 26 29 32 37 41 46 50 2 4 5 12 16 19 22 26 29 32 37 41 46 50 Example Looking for 46 2 4 5 12 16 19 22 26 29 32 37 41 46 50 2 3

18. SortingSort students by birth date • Get a group of 5 students • Another student will sort them by birth date • Analyze the sorting strategy • Can we devise an algorithm following that strategy? • Goal: sort following a methodology • We should be able to write it as an algorithm and then program it • Demonstrate selection sort • Write algorithm

19. Selection SortGeneral Algorithm • Scan the list to find the smallest value • Swap that value with the value in the first position in the list • Scan rest of list to find the next smallest value • Swap that value with the value in the second position in the list • And so on, until you get to the end of the list

20. Selection SortMethods • Scan the list to find the smallest value • Swap that value with the value in the first position in the list • Scan rest of list to find the next smallest value • Swap that value with the value in the second position in the list • And so on, until you get to the end of the list loop

21. Selection Sort • Sorts in ascending order • Can be changed to sort in descending order • look for max instead of min

22. Homework 6 • Read/write files • Array of ints • Array of Participant objects • Next: • Sort array of ints • Sort array of participants • Extra credit: group participants

23. Tomorrow • Java applets • HTML • GUIs • Reading Assignment: • Chapter 6 pp. 302-328 (pp. 264-290 in old book) • skim Chapter 13 pp. 835-915 (pp. 725-806 in old book)