DSA-in-December

✨ 𝗗𝗮𝘆 𝟱: 𝗦𝗲𝗮𝗿𝗰𝗵𝗶𝗻𝗴 𝗔𝗹𝗴𝗼𝗿𝗶𝘁𝗵𝗺 ( 𝗟𝗶𝗻𝗲𝗮𝗿 𝗮𝗻𝗱 𝗕𝗶𝗻𝗮𝗿𝘆 𝗦𝗲𝗮𝗿𝗰𝗵) ✨

📌 Linear search is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data collection. 📌 Binary search is a fast search algorithm with run-time complexity of Ο(log n). This search algorithm works on the principle of divide and conquer. For this algorithm to work properly, the data collection should be in the sorted form.

✏️ 𝗙𝗼𝗿 𝗯𝗲𝘁𝘁𝗲𝗿 𝘂𝗻𝗱𝗲𝗿𝘀𝘁𝗮𝗻𝗱𝗶𝗻𝗴 𝗿𝗲𝗳𝗲𝗿 𝗳𝗼𝗹𝗹𝗼𝘄𝗶𝗻𝗴 𝗮𝗿𝘁𝗶𝗰𝗹𝗲𝘀 ;

1. https://medium.com/free-code-camp/binary-search-algorithm-7170ae244438
2. https://www.geeksforgeeks.org/linear-search/
3. https://www.javatpoint.com/linear-search
4. https://www.geeksforgeeks.org/binary-search/
5. https://www.javatpoint.com/binary-search

📽️ 𝗧𝘂𝘁𝗼𝗿𝗶𝗮𝗹 𝗟𝗶𝗻𝗸𝘀;

1. https://www.youtube.com/watch?v=13ocRMSJy5M
2. https://www.youtube.com/watch?v=f6UU7V3szVw
3. https://youtu.be/sSYQ1H9-Vks
4. https://youtu.be/SpS9dMj0B_Y
5. https://youtu.be/B4t3NB0478k
6. https://youtu.be/_HRA37X8N_Q

👨‍💻 𝗤𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝗶𝗻𝗴 𝗥𝗼𝘂𝗻𝗱 :

★ 𝟰 𝗽𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 ★

1. https://leetcode.com/problems/search-in-rotated-sorted-array/
2. https://leetcode.com/problems/search-insert-position/
3. https://www.hackerrank.com/challenges/icecream-parlor/problem?isFullScreen=true
4. https://www.hackerrank.com/challenges/sherlock-and-array/problem?isFullScreen=true