Shrey Sharma

This is a course which will provide you a prominent grip on Binary Search Technique, which is considered to be one of the most popular searching techniques. As Binary Search is the basis of Binary Search Tree, it becomes necessity have a clear and firm understanding of Binary Search Concepts. This course will help you develop a good understanding of Binary Search and its modifications, which will be helpful in solving Competitive Programming questions as well as in various Data Structure implementations.

Programming

English

Binary Search: The Smarter Way

Competitive Programming

Searching

Basics

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

In this lesson,we will discuss the traditional Linear Search Technique, and the need of advancing to the Binary Search.

Linear Search and It's Loopholes

In this lesson, one will be introduced to the concept and theory of Binary Search and the Algorithm involved with it.

Binary Search- The Smarter Way

In this lesson, Shrey has discussed the limitations and advantages of Binary Search which includes the Time Analysis for this useful search technique.

Binary Search- Terms and Condition

This is one of an essential lesson of the course which includes the discussion on the code implementation of Binary Search Algorithm using recursive as well as iterative approach.

Binary Search - Implementation

In this lesson, Shrey has discussed the modifications to be made in binary search code, to implement first occurrence and last occurrence searches for a given key value.

Advances in Binary Search

This lesson involves another forward step in field of modification, which provides us some more useful search results.

Modifications in Binary Search

In this lesson, a basic search problem is solved using Binary search and a time comparison between Linear and Binary search is provided.

Basic Question on Binary Search

In this lesson we will discuss the ways through which we can use Binary search in STL implementation for C++.

Binary Search using STL

In this lesson, Shrey has discussed problem INTERSTING DRINK from Codeforces competition.

Trying your hands in Competitive Programming

Quant Researcher at Algorithm Trading/Computer Science NSIT/Competitive Coding

Shaksham Garg

The course is about linked list data structure. The prerequisites for the course are: Pointers; Dynamic Memory Allocation. 
The course first gives an introduction to linked list then discusses about operation that can be performed on linked list.

Data Structure and Algorithms - Linked List

This series aims to take your programming to the next level. The series focuses on aspiring programmers who aim to be better at coding.

Hackerearth Inc.

The collection begins with an indispensable searching algorithm, Binary Search and tries to get a basic understanding of where it can be used. The next two lessons solve problems for the important application of Binary Search in Competitive Programming. In these two lessons, one can Binary Search for the answer in a range of values and learn how to exploit the behavior of a variable.

Discovering Faster Methods To Search For The Answer

Computer Science engineering VIIth semester
java certified from Oracle with 95%
for updates - follow on Instagram unacade_my


Niharika Kushwah

practical understanding of OOP'S concepts and implementation of OOP'S concepts using Python. understanding of file handling and exception handling.

OOP's and More Using PYTHON

CSE Engineer. Tech. Enthusiast. Hard Worker and Problem Solver.

Vivek Seth

This course discusses how sorting algorithms work - selecting the best algorithm for a particular task, calculating each algorithm's complexity (time and space) in order to effectively use them etc.

(Hindi) Advanced Sorting Algorithms

Student studying in VIT university, Pursuing undergrad in IT(information tech),
loves to code and teach.

Kusumanchi Vineeth

In this course, Kusumanchi Vineeth has discussed Data Structures. He has covered bubble sort, merging the sorting list, algorithm for bubble sorting, examples, advantages and disadvantages.

Bubble Sort in Data Structures

The course explains basic sorting algorithms like Bubble Sort, Insertion Sort, Selection Sort and Merge Sort - how they work, how to build algorithms using them to use in different platforms and also choosing best algorithms based on their time and space complexities.

Lessons

9 lessons • 1h 14m

Invalid Date

NaN

Linear Search and It's Loopholes

Invalid Date

NaN

Binary Search- The Smarter Way

Invalid Date

NaN

Binary Search- Terms and Condition

Invalid Date

NaN

Binary Search - Implementation

Invalid Date

NaN

Advances in Binary Search

Invalid Date

NaN

Modifications in Binary Search

Invalid Date

NaN

Basic Question on Binary Search

Invalid Date

NaN

Binary Search using STL

Invalid Date

NaN

Trying your hands in Competitive Programming