IcodewithbenLearning how to break down coding problemsTwo people play a counting game. The rules of the game are as follows:Nov 18
IcodewithbenBrute Force vs Heurisitc approach with backtracking, with the Subset Sum ProblemGiven a set of numbers, find a subset of numbers that sums up to a target value.Nov 18Nov 18
IcodewithbenBig O Notation:Here’s a table summarizing the time and space complexity for Bubble Sort, Insertion Sort, Merge Sort, and QuickSort in Big O notation:Oct 22Oct 22
IcodewithbenComputational Thinking NotesAbstraction of a problem helps to understand it better as you may not need to show all the details, for example the London Underground map…Nov 18Nov 18
IcodewithbenLearning how to break down coding problemsTwo people play a counting game. The rules of the game are as follows:Nov 18
IcodewithbenBrute Force vs Heurisitc approach with backtracking, with the Subset Sum ProblemGiven a set of numbers, find a subset of numbers that sums up to a target value.Nov 18
IcodewithbenBig O Notation:Here’s a table summarizing the time and space complexity for Bubble Sort, Insertion Sort, Merge Sort, and QuickSort in Big O notation:Oct 22
IcodewithbenComputational Thinking NotesAbstraction of a problem helps to understand it better as you may not need to show all the details, for example the London Underground map…Nov 18
IcodewithbenMerge Sort:Merge sort is a divide-and-conquer algorithm that divides the input array into two halves, calls itself for the two halves, and then merges…Oct 22
Dylan YeoShakespeare’s King Lear: Analysis (1)In this series, I will be sharing the literature analysis essays I have written as part of my preparation for CAIE’s A2-Level Literature in…Nov 17
IcodewithbenRecursion ExplBlastoff!Recursion is a programming technique where a function calls itself to solve a problem by breaking it down into smaller instances of the…Oct 31, 2023
