Linear arrays: Difference between revisions
Mr. MacKenty (talk | contribs) No edit summary |
Mr. MacKenty (talk | contribs) No edit summary |
||
| Line 3: | Line 3: | ||
There are four common algorithms we use on a linear array. Although the IB asks only for you to know these at the pseudocode level, I suggest you memorize these for the rest of your life. | There are four common algorithms we use on a linear array. Although the IB asks only for you to know these at the pseudocode level, I suggest you memorize these for the rest of your life. | ||
You will remember | You will remember we use [[arrays|array]] to hold values of the same type at contiguous memory locations. In particular, the use of arrays allows us to create "groups" or "clusters" of variables without needing to give a unique variable name to each, but still allowing us to individually index into the elements of the array.<ref>http://cs50.wiki/Arrays+and+strings</ref> | ||
* Sequential search | * Sequential search | ||
Revision as of 16:10, 27 July 2017
Linear arrays[1]
There are four common algorithms we use on a linear array. Although the IB asks only for you to know these at the pseudocode level, I suggest you memorize these for the rest of your life.
You will remember we use array to hold values of the same type at contiguous memory locations. In particular, the use of arrays allows us to create "groups" or "clusters" of variables without needing to give a unique variable name to each, but still allowing us to individually index into the elements of the array.[2]
- Sequential search
- Binary search
- Bubble sort
- Selection sort
Do you understand this?[edit]
Standards[edit]
These standards are used from the IB Computer Science Subject Guide[3]
- Describe the characteristics of standard algorithms on linear arrays.
References[edit]
- ↑ http://www.flaticon.com/
- ↑ http://cs50.wiki/Arrays+and+strings
- ↑ IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.