Computational thinking and problem solving

What you'll learn

• Write algorithms to implement linear and binary searches.
• Identify the conditions necessary for the use of a binary search.
• Describe how the performance of a binary search varies according to the number of data items.
• Write algorithms to implement insertion and bubble sorts.
• Use abstract data types (ADTs) including finding, inserting and deleting items from linked lists, binary trees, stacks and queues.
• Explain the key features of a graph and why graphs are used.
• Implement ADTs from other ADTs.
• Compare algorithms including the use of Big O notation.
• Express recursion in a programming language and write recursive algorithms.
• Explain when to use recursion and how a compiler implements it.

Study tools for this chapter

Pick a format and jump in — all tools are syllabus-mapped to Computational thinking and problem solving.

About Computational thinking and problem solving on Nexelia Academy

Frequently asked questions about Computational thinking and problem solving