Watch Demo

Rs. 699  Rs. 499

Byte-Sized-Chunks: Sorting and Searching Algorithms

Build a strong foundation in algorithms by mastering it through the most effective technique of learning- visualization. In this course, you will learn Complexity, Big-O notation and different types of Sort and searches

Lifetime access
12 learners
Course Overview:

Sorting is nothing but storage of data in logical order. It could be in ascending or descending order. The term Sorting came into picture along with the term- Searching. There are a number of things in our real life that we need to search, such as a particular record in database, roll numbers in merit list, a particular phone number etc. Sorting and Searching algorithms help us do just that.

Data Structures and Algorithms are best learnt visually. It is incredibly easy to learn visually and very hard to understand any other way. Our brains process information differently - evolutionarily we are wired to digest information best when it is visual and spatial i.e. when we can close our eyes and see it.

Read more

Course Objectives

By the end of this course you will be able to:

  • Use sorting and searching algorithms to design and implement software
  • Grasp the complexity, trade-offs, and use-cases for various types of sort and search algorithms
  • Visualise common data structures, and the algorithms applied to them

Prerequisites and Target Audience

Basic knowledge of programming is necessary. Knowledge in Java would be preferable.

This tutorial is designed for:

  • Computer Science and Engineering graduates who are looking to visualise data structures and internalise how they work
  • Experienced software engineers who want to brush-up on important fundamental concepts

Course Plan
Certificate of completion

1.  Needle In A Haystack: Sorting and Searching!
14 videos
You, This Course, and Us! 01:08

Selection Sort 15:24

Bubble Sort 14:42

Insertion Sort 14:32

Shell Sort 14:24

Merge Sort 19:23

Quick Sort 15:24

Binary Search - search quickly through a sorted list 11:09

Heap Sort Phase I - Heapify 19:31

Heap Sort Phase II - The Actual Sort 17:42

Meet the Author

4 Alumni of Stanford, IIM-A, IITs and Google, Microsoft, Flipkart

Loonycorn is a team of 4 people who graduated from reputed top universities. Janani Ravi, Vitthal Srinivasan, Swetha Kolalapudi and Navdeep Singh have spent years (decades, actually) working in the Tech sector across the world.

  • Janani: Graduated from Stanford and has worked for 7 years at Google (New York, Singapore). She also worked at Flipkart and Microsoft.
  • Vitthal: Studied at Stanford; worked at Google (Singapore), Flipkart, Credit Suisse, and INSEAD.
  • Swetha: An IIM Ahmedabad and IIT Madras alumnus having experience of working in Flipkart.
  • Navdeep: An IIT Guwahati alumnus and Longtime Flipkart employee.
  • More from Loonycorn
    Ratings and Reviews     4.7/5

    You may also like