CSE110 Lecture 23

Principles of Programming with Java
Arrays II
(202006)

Transcript

1. CSE110 Principles of Programming with Java Lecture 23: Arrays II Javier Gonzalez-Sanchez javiergs@asu.edu javiergs.engineering.asu.edu | javiergs.com Office Hours: By appointment
2. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 2 What is the error?
3. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 3 Bounds Checking
4. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 4 Printing an Array
5. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 5 The constant length
6. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 6 Example
7. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 7 Algorithms
8. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 8 Algorithms Populating Arrays int [] num = new int[1000]; int size = 100; int [] num2 = new int [size]; for (int i=0; i <num2.length; i++) num2[i] = 2 * i; index content 0 1 2 3 4 5 6 7 8 9 0 2 4 6 8 10 12 14 16 18
9. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 9 Initializer Lists
10. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 10 Initializer Lists
11. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 11 Algorithms
12. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 12 Algorithms
13. Javier Gonzalez-Sanchez | CSE110 | Summer 2020 | 13 Reference Chapter 6
14. CSE110 - Principles of Programming Javier Gonzalez-Sanchez javiergs@asu.edu Summer 2020 Disclaimer. These slides can only be used as study material for the class CSE110 at ASU. They cannot be distributed or used for another purpose.