B.Tech in ECE. Pursuing M.Tech in  Machine Learning and Artificial Intelligence. Eternal student of Science and Technology.

Deepak S

This course is intended to familiarize students with different divide and  conquer algorithms and how to use it for problem solving.

GATE (Graduate Aptitude Test in Engineering) 2020 & 2021 complete preparation with best educators. Know about the detailed syllabus, best books, exam pattern and dates, previous year question papers a

GATE - Iconic Pro

English

Divide and Conquer Algorithms

Algorithms

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Test Preparation

Introduction into Divide and Conquer Technique and Solution to Tower of Hanoi Problem

Introduction to Divide and Conquer

Lesson 2: Binary Search (Pseudo Divide and Conquer)

Binary Search (Pseudo Divide and Conquer)

Merge Sort

Quicksort Algorithm Explained, Complexity discussed

Quick Sort

Part 1 of the lesson explaining the  Divide and Conquer Algorithm to find Closest Pair of Points.

Closest Pair of Points-Part 1

Part 2 of the lesson explaining the  Divide and Conquer Algorithm to find Closest Pair of Points.

Closest Pair of Points - Part 2

Explaining the Algorithm to find the Kth Largest or Smallest Element in an unsorted array. (Quick Select)

Kth Largest/Smallest Element of an unsorted array (Quick Select)

Lesson Explaining Karatsuba Algorithm for fast multiplication.

Karatsuba Algorithm for fast multiplication

Code HELLOSONU01 | 8+ Years Teaching Exp. in GATE CS IT & GATE DS AI on Unacademy | Mentored 2 Lakh+ Students | Produced Rankers Under 500

Sweta Kumari

This course will cover Artificial Neural Networks in just 60 Minutes with full package.

(Hindi) Artificial Neural Networks in 60 Minutes

This course has discussed Sorting Algorithms with Complexities, working and some FAQs. The course will be beneficial for Engineering students and GATE aspirants.

(Hindi) Short Tricks to Remember Complexities of Sorting Algorithms

This course will cover dynamic Programming solution for Matrix Chain Multiplication and Longest Common Subsequence.

(Hindi) Dynamic Programming : MCM & LCS

This course will cover Asymptotic Analysis Of Algorithms with short notes targeted for GATE Aspirants.

(Hindi) Asymptotic Analysis Of Algorithms in 40 Minutes - GATE 2019

This course will cover Searching Algorithms Like Linear , Binary & Interpolation Search for  GATE CS/IT.

(Hindi) Searching Algorithms : Linear , Binary & Interpolation Search - GATE CS/IT

This course will cover 100 Short Tricks To Learn Complexities of Algorithms Easily. This Course is beneficial for  GATE (CS and IT) aspirants.

Lessons

8 lessons • 1h 32m

Invalid Date

NaN

Introduction to Divide and Conquer

Invalid Date

NaN

Binary Search (Pseudo Divide and Conquer)

Invalid Date

NaN

Merge Sort

Invalid Date

NaN

Quick Sort

Invalid Date

NaN

Closest Pair of Points-Part 1

Invalid Date

NaN

Closest Pair of Points - Part 2

Invalid Date

NaN

Kth Largest/Smallest Element of an unsorted array (Quick Select)

Invalid Date

NaN

Karatsuba Algorithm for fast multiplication