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.

Programming

English

Discovering Faster Methods To Search For The Answer

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 video, we start with an indispensable searching algorithm, Binary Search and try to get a basic understanding of where it can be used. 
For reference, 
https://www.hackerearth.com/notes/searching-code-monk/

Binary Search : Intro

In this video, we solve a problem where we Binary Search for the answer in a range of values.  
For more problems on Binary Search, refer to https://www.hackerearth.com/topics/searching-and-sorting/binary-search/.

Problem 04 : Search For The Key

This video covers an important application of Binary Search in Competitive Programming as we solve a problem that exploits the behavior of a variable. 
For more problems on Binary Search, refer to https://www.hackerearth.com/topics/searching-and-sorting/binary-search/.

Problem 05 : The Power Of Binary Search

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

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.

Binary Search: The Smarter Way

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

3 lessons • 23m

Invalid Date

NaN

Binary Search : Intro

Invalid Date

NaN

Problem 04 : Search For The Key

Invalid Date

NaN

Problem 05 : The Power Of Binary Search