Introduction to Dynamic Programming

-

This is a quick 5 minute easy-to-read programme, for even the least experienced programmers.


So you wanna see c some new programming, or some new epic pro-gamer moves to up your competitive programming skills.

Well, look no further with this CPMsoc blog on dynamic programming!


Well, the obvious question is what is dynamic programming?


Dynamic programming is programming that is dynamic.


A quick google search would reveal (or at least according to Programiz), " technique in computer programming that helps to efficiently solve a class of problems that have overlapping subproblems and optimal substructure property."


What does this actually mean though?


The paramount idea regarding dynamic programming circulates around the idea of sub-programs; essentially taking a large problem and breaking it down into smaller problems. Then, the values of the smaller-problems are saved to be used later to solve the initial, larger problem.


Accordingly, the key benefit of dynamic programming in comparison to other modes of problem-solving, is by saving the result, is has the ability to optimize the solution by decreasing the repetition, thus increasing the overall-run time.


But before, we uncover more into dynamic programming, let's review recursion and memoization.


RECURSION



Welp, we find ourselves asking ourselves, what is meant by recursion.


Once again, a quick, frantic google search uncovers that recursion can be defined as "the determination of a succession of elements(such as numbers or functions) by operation on one or more preceding elements according to a rule or formula involving a finite number of steps".


We can reconceptualise recursion with the aid of an example.


Let’s imagine that we need to calculate how many stairs are in total for the UNSW Stair of Dooms

 Main Walkway. But since our programming overlords directors are busy the task falls on me. Now, due to let’s say my very limited mathematics skills and oversight fail in MATH1131, I lack the ability to count them incrementally. 


So, collectively, the members of CPMSoc came up with a solution.


Starting with me standing at the top of the staircase, on each step below me stands one CPMSoc member. So I ask the person in front of me how many steps there are, knowing that if the person in front of me says there is an "x" amount of stairs, there is in total and "x+1" amount of stairs. This is a subproblem; I solve for "x + 1" amount of steps, instead of the initial total. Then, the person in front of me asks the same question who asks the person in front, and this goes on and on, until there is no one in front to ask. Once, we reach the bottom of the staircase, where no one is standing, that is the base-case, of zero individuals standing


Now, we know that eventually, as each, person asks the person in-front, we will reach the bottom where no person is standing. This principle is referred to as "bottoming-out" in the context of recursion programming; a condition (in our case, the fact that at the bottom of the staircase there are ZERO people), that stops further calculation.


Below, enclosed are fragments of code that respectively use iteration and recursion. 


Recursion vs Iteration

#include <stdio.h>

#define NUMBER_VALUE_OF_STAIRS 1000

int main (void){
   
    int counter = 0;
    int actual_number_of_steps = NUMBER_VALUE_OF_STAIRS;

    while(counter < actual_number_of_steps){
        counter++;
    }

    printf("There is a total of %d steps", counter);
}




int recursive_function(n){
    if (n == 0){
        return 0;
    } else {
        return n + recurive_function(n-1)
    }
}



Technical Corner: If you are interested in Fibonacci Code and the difference in memory allocation for recursion and iteration a great resource to check alongside some practice question check out a great resource here. For more, information about the context, check out there.

Hopefully you learnt something so far other than a lot of pain could be saved if UNSW chose to install elevators. 

But, with a dramatic drumroll, we move on to the next section of our blog to....


MEMOIZATION

Well memoization relays on key, principles of memory, specifically, cache. 

Keeping in pattern of frantic-google-searches, an input of "What is a Cache" in Google prompts a swift response of "hardware or software that is used to store something, usually data, temporarily in a computing environment."

Cache is used often in our day-to-day lives; from deleting internet browser histories on how to arson UNSW to its benefits to programming optimization(a fun read on non-programming benefits can be found here). 

Memoization is a subset of cache, where specifically the return value in functions can be saved. In doing so, if a function is later called with the same input, the output can be generated, without need for calculation. 

This offers the key benefit of memoization: the optimisation benefits relaying to time-complexity as implementing memoization significantly reduces time of recalculating results. 

Whilst, this specific blog isn't going to focus as much as on the implementation of memoization, for those interested a great resource, I would recommend is here.

Now, as we move forward, we are going to look more closely at memoization in the context of dynamic programming.

DYNAMIC PROGRAMMING

The benefits of dynamic programming are exhibited through the steps of calculating the Fibonacci problem. 

NOTE: As an exercise, after reading the explanation below, try yourself writing a programme to solve for Fibonacci sequences. See, how many different ways and methods can be used to conjure a result.


It is calculated, recursively, where the sub-problem is established by calculating incrementally smaller numbers. From the diagram above, it evidences how it "bottoms-out", until it reaches base cases of fib(1) and fib(0).

Next, memoization is implemented to, save the values of fib(1) and fib(0), so when recursively called upon, the results are already stored. The specific, type of dynamic programming we talked about this week is top-down which utilises memoization and recursion. If you are curious, into the implementations of various programmes to solve the Fibonacci sequence and the difference in implementations, a good exercise would be to peruse this, 

The next blog on Dynamic Programming will answer your remaining the burning questions: is bottom up dynamic programming or top down dynamic programming the most elite, which has better time complexity. 

That's all from us, folks!

Popular posts from this blog

Tips for Competitive Programming

-
Image
Competitive programming is by no means easy, I struggled with it for a long time. In this post I want to provide some helpful tips, which will hopefully be helpful to you at any stage in your competitive programming journey. How do I read problems? Read all the problems It is not always the case that the first problem is the easiest, because it cannot be assumed that problems are in difficulty order. Even if it was in "difficulty order", what the tutors think is difficult may be different from what you think is difficult. Read all the subtasks (this doesn't apply for contests such as ICPC) Subtasks help guide you towards observations and partial solution by presenting helpful subproblems. Note that this isn’t
Read more

Implementation tips for competitive programming

-
Implementation tips for competitive programming It’s uncommon for code you write to work properly the first time you run it. And if you’re not careful, you can spend hours debugging and still be left with code that doesn’t work. This is especially problematic in ICPC, when you have only one computer between three people. Below are a few tips on how to improve the implementation and debugging process.  Before you start implementing Proving your solution Once you have a solution, the first step is to convince yourself it is correct. If you skip this step, you could invest a lot of time into coding only to later realise that your entire idea is incorrect. You don’t need a formal mathematical proof, just enough that you are sure it works. When doing this, try to think about the worst cases which could break your algorithm, and then reason why they do or do not.  Planning your code Once you are sure you have a correct solution, the next step is to
Read more

The Art of Making Programming Problems

-
Image
Hello! Today we’ll explore the wonderful world of creating problems for programming contests. This article could be used as a sort of guide if you’re interested in writing problems yourself, but it’s intended for anyone interested in the process or philosophy behind making problems.   The scope of the article is quite broad, and in its four parts, we will discuss (1) why to make programming problems, (2) how to invent problems, (3) how to plan a contest, and (4) how to prepare problems. Do feel free to skip around if any of these topics tickle your fancy, or if you’re up for it, I invite you to read the article through from top to bottom. A lot of the thoughts presented here are based on my own modest experience with problem setting, mainly for university contests, informatics olympiads and miscellaneous educational purposes. Keep in mind that nothing I say is meant to prescribe a correct way to do things, just to describe what I’ve personally found effective for the work I’ve done. So
Read more

Interactive Tasks

-
Interactive tasks are tasks where your code interacts with another program, often called a grader , rather than simply reading input and printing output. Due to this novel format, people are often scared off and avoid attempting these problems. My goal in this blog is to remove your fear towards interactive tasks. Example Let's start with a basic example, Guess the Number , which you can view in more detail here . There is some hidden number and you have to interactively guess it. The hidden number is always an integer from 1 to 1000000.  You can make queries to the grader. Each query is an integer from 1 to 1000000. There are two different responses the grader can provide: "<" (without quotes), if the hidden number is less than the integer in your query, ">=" (without quotes), if the hidden number is greater than or equal to the integer in your query. When your program wants to guess the hidden number, print "! x" (without quotes), where x is th
Read more

Sqrt linked lists

-
Image
I present a (novel?) variation of a linked list, which allows for insertion, deletion and querying in worse case O(sqrt(n)) If these things interest you, you may like to look at: big O notation, otherwise known as time complexity. This is a useful method to measure how fast things are, rather than looking at the number of "steps" in the worse case. https://onecore.tech/informatics/5 skip lists, a similar variation with a randomised aspect. It is faster than mine in the average case, but slower in the worse case. https://en.wikipedia.org/wiki/Skip_list B-trees, which although are not linked lists, are faster than mine in all cases. Not to be confused with binary trees. https://en.wikipedia.org/wiki/B-tree // Written by Ryan Ong (z5419383) // on 14/04/2022 /** * Sqrt Linked List! * I want to answer these queries in about sqrt(n) steps: * - "insert this value at index i" * - "remove the value at index i" * - "what is the value
Read more

Introduction to Competitive Programming

-
Introduction to Competitive Programming  Have you heard your friends talk about LeetCode or Codeforces contests? Maybe you’re wondering what competitive programming is all about. Here’s what you need to know. What is Competitive Programming? Competitive Programming (CP, or sometimes known as Informatics) is an activity where we try to solve clearly defined computational problems using code. The 'competitive' part of CP comes from the numerous contests where people aim to correctly solve as many problems as possible in a fixed timeframe, typically around two to five hours. Solutions must also follow time and memory constraints which means your code needs to be both correct and efficient. These problems are thought to train and test you in three related areas: Problem solving . Algorithms and data structures , which we apply to solve problems efficiently. Implementation , the process of writing and testing code. Many people participate in competitive programming for the challeng
Read more

Fracturing Search

-
Image
Have you ever had that insatiable urge to find the kth smallest minimum spanning subtree which of a weighted graph? (I know I have) Well look no further! This post will an exploration of fracturing search and its applications. (No prerequisite knowledge it required to understand the concepts, although it will be helpful graph theory terminology and an algorithm that solves the standard minimum spanning tree problem.) An example - finding the kth smallest value in a heap Fracturing search is a method that partitions your search space, and explores it in a way to get the "kth best" item. Let me illustrate with an example: Lets consider a heap, which is a binary tree where the value of a parent is always strictly smaller than the value of any child (this property is known as the heap invariant). For example, 1 < 2 and 1 < 7, because (1) is the parent of (2) and (7). We want to find the kth smallest value. Now is a good time to pause and think if you want to try it yourself
Read more

Union-find Disjoint set

-
Image
Union-find Disjoint set (UFDS) is an abstract data structure that simulates a collection of elements belongs to a collection of sets, where we need to support the following two operations Determine if two element belongs to same set, Combine two disjoint set. Such a data structure can be helpful in situation such as finding connected component of a diagram, for example Kruskal's algorithm. Linked list Implementation We would want to support the above operation with decent efficiency. The main paradigm  for supporting such data structure is to choose one unique element to represent the  set. Then, a naïve approach would be using a linked list, where each node contains a  parent pointer points back to the head, which is used to represent the set . It gives  constant time to determine if two element belongs to same set by looking  up the parent pointer's address of this two element. To combine two disjoint sets, denote set S1 and set S2 . The operation would be choice  one set f
Read more