Binary Search and Hashing Full Course 2023 | Data Structures and Algorithms 2023 | Scaler

🔹 Introduction To Binary Search Algorithms:

Binary Search Algorithms are used to find a target value in a sorted array. Binary search functions by comparing the target value to the middle element in the array. If the element doesn’t match the target value, the half in which the target cannot lie is eliminated and the search continues on the remaining half. The process of identifying the middle element and weeding off the half least likely to have the target value continues until the target value is found. If the search ends with the remaining half being empty, the target is not in the array.

🔹 Binary Search Algorithm Time And Space Complexity:

The time complexity of the binary search algorithm is O(log n). The best-case time complexity would be O(1) when the central index would directly match the desired value. The worst-case scenario could be the values at either extremity of the list or values not in the list.

🔹 What is Hashing algorithm?

Hashing algorithm or Hashing as it is commonly called involves mapping a large amount of data item to a hash table using the hashtag function. The efficiency of mapping primarily depends on the hash function that is used.

🔹 Hash Function

For hash table based search, choosing a good hash function h(k) is key. h should be able to distribute the elements uniformly across the slots of the hash table.

The following topics are covered in this Binary Search and Hashing Full Course video 👇🏼

0:00 Introduction to searching
16:00 Example on binary search
48:28 Time complexity of binary search
55:22 Ternary search
1:06:00 Binary search implementation
1:13:39 Binary search company questions
1:41:51 Binary search problem 2
2:04:41 Binary search problem 3
2:26:18 Binary search problem 4
2:37:38 Binary search advanced problems 1
2:53:40 Binary search advanced problem 2
3:25:35 Binary search advanced problem 3
3:50:01 Hashing in data structure with example
4:20:00 Collision in hash function
4:25:40 Hashing in data structure problem 1
4:40:27 Hashing problem on anagram
4:53:39 Hashing problem on longest substring without repeat

---------------------------------------- About Scaler --------------------------------------------------

We are a tech-focused upskilling and reskilling platform catering to tech enthusiasts in universities and working professionals. There are more Scaler graduates working at Amazon than all of the IITs combined!

📌 Follow us on Social and be a part of an amazing tech community📌

🔔 Hit that bell icon to get notified of all our new videos 🔔

If you liked this video, please don't forget to like and comment. Never miss out on our exclusive videos to help boost your coding career! Subscribe to Scaler now!

#binarysearch #hashing #codingquestions #dsalgo