Algorithm design has some techniques which are used to create algorithms and out of such techniques is Divide and Conquer. It is a technique in which we basically do two things: Divide the given problem into smaller sub problems till they constitute a unit problem that can be solved easily/independentlyNow solve all those sub problems … Continue reading Lecture#2 : Divide and Conquer
Month: January 2019
Lecture 1: Introduction
Algorithms An algorithm is a set of steps designed to perform a certain task. The steps of an algorithm are primitive where a primitive step is an operation that is not needed to be divided further, e.g., Assignment (a=b) Addition, Subtraction, Multiplication, Division Comparison The primitive operations require a constant time and we call them … Continue reading Lecture 1: Introduction
Homework 0: Introduce Yourself
This homework is mandatory for all the registered students. Write your name, roll number and a puzzle in the comments section of this post.
Design & Analysis of Algorithms – Spring 2019
Welcome to Algorithms! The course aims to throw light on techniques of designing algorithms and investigating how can we compare different algorithms designed to solve the same problem. This blog is created for sharing course materials and serving as an interactive platform for discussing the content of the course. Follow this blog using ITU's email … Continue reading Design & Analysis of Algorithms – Spring 2019
You must be logged in to post a comment.