Computational Problem Solving: Week 1 Lecture Notes and Basics

This document provides comprehensive lecture notes on computational problem-solving, focusing on algorithms, problem-solving cycles, and fundamental concepts. The notes cover various sorting and searching algorithms, including Bubble Sort, Insertion Sort, Selection Sort, Radix Sort, Quick Sort, Linear Search, and Binary Search. The assignment also delves into bin packing algorithms, sequences, series, matrices, and limits, with applications to Shannon Entropy and Google interviews. Furthermore, the notes include extension topics on numerical and infinite series and conclude with an analysis of the problem-solving cycle, illustrated through the game of noughts and crosses, and extends the solution to describe the number of winning lines when playing noughts and crosses on an 𝑚 × 𝑛 grid, where 𝑚 and 𝑛 are positive whole numbers given that a winning line is 𝑝 units long.