Linear arrays: Difference between revisions
Mr. MacKenty (talk | contribs) (Created page with "right|frame|Linear arrays<ref>http://www.flaticon.com/</ref> == Identifying examples of abstraction == (awaiting permission to post material) '''Anyt...") |
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 enact on an array. | |||
* Sequential search | |||
• Binary search | |||
• Bubble sort | |||
• Selection sort | |||
== Do you understand this? == | == Do you understand this? == |
Revision as of 13:17, 27 July 2017
There are four common algorithms we enact on an 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.