Linear Search Vs Binary Search All programmers are familiar with Linear search and Binary Search. Generally, we use them to search for any element and its location. Today’s discussion is about the comparison of these two searching algorithms. 1. Sequential: The linear search follows sequence and Binary search doesn’t follow. The linear search starts searching from the starting to ending … Continue reading Linear Search Vs Binary Search

Some Resources for Machine Learning and Deep Learning I am following these resources according to this sequence. I am posting this for the newbie like me. I hope it’ll help you. 1. Linear Algebra: https://www.youtube.com/playlist?list=PLZHQObOWTQDPD3MizzM2xVFitgF8hE_ab 2. Differential Equation: https://www.khanacademy.org/math/differential-equations 3. Multivaribal Calculus: https://www.khanacademy.org/math/multivariable-calculus 4.Statistics and probability: https://www.khanacademy.org/math/statistics-probability     5.Machine Learning : [Basic ML] https://www.coursera.org/learn/machine-learning 6. Deep Learning : [Basic DL] https://www.youtube.com/channel/UCcIXc5mJsHVYTZR1maL5l9w 7. Deep Learning:[Basic … Continue reading Some Resources for Machine Learning and Deep Learning

Divide and Conquer (Merge Sort) Divide and conquer is an algorithmic strategy works by breaking down a problem into two or more sub-problems of the same or related type, solving them and make an addition of the sub problems. Let make it clear. In divide and conquer technique we need to divide a problem into sub-problems , solving them recursively and … Continue reading Divide and Conquer (Merge Sort) 