Linear arrays: Difference between revisions
Mr. MacKenty (talk | contribs) No edit summary |
Mr. MacKenty (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
[[file:arrows.png|right|frame|Linear arrays<ref>http://www.flaticon.com/</ref>]] | [[file:arrows.png|right|frame|Linear arrays<ref>http://www.flaticon.com/</ref>]] | ||
There are four common algorithms we | 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 a linear [[array]] | |||
* Sequential search | * Sequential search | ||
Revision as of 17:00, 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 a linear array
- 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[2]
- Describe the characteristics of standard algorithms on linear arrays.
References[edit]
- ↑ http://www.flaticon.com/
- ↑ IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.