# UdaySk  ## Data Structures and Algorithms | C++ STLs￼

In this article, we will be looking at a brief introduction to Data Structures and Algorithms | C++ STLs and some very important STLs like Pairs, Vectors, and Lists. STL stands for Standard Template Library, this provides four components like Algorithms, Containers, Functions, and Iterators. Containers – The containers are a type of data structure … ## Recursive Implementation of Binary Search

This article is the extension of the last article “Binary Search Algorithm” in which we have covered the basic idea around binary search and how its works along with the Recursive Implementation of Binary Search. In this article, you will learn the implementation of Binary search in different languages like Python, Java, and C++. You … ## Binary Search Implementation and Time Complexity Analysis￼

This article is the extension of the last article “Binary Search Algorithm” in which we have covered the basic idea around binary search and how its works along with two types of algorithms (Iterative and Recursive). Binary Search Implementation and Time Complexity Analysis In this article, you will learn the implementation of Binary search in … ## Binary Search

In this article, you will learn what is Binary Search Algorithm and how it works. We will discuss both Iterative and Recursive approaches. In the next article, we will discuss the implementation of binary search and the time and space complexity analysis. Introduction The Binary Search follows the “Divide and conquer” algorithm for searching an …

## Horner’s Rule and Recurrence Relation

Introduction In this article, we are going to have a look at Horner’s Rule and Recurrence Relation. The taylor function takes the same three parameters as before: x, a, and n. It uses a static variable sum to store the current sum of the Taylor Series. The base case of the recursion is when n … ## Taylor Series using Recursion

Introduction In this article, we are going to have a look at Taylor Series using Recursion. Taylor Series is a mathematical concept that approximates any continuous and differentiable function as an infinite sum of powers of x. It is a powerful tool in calculus and is used extensively in engineering, physics, and other sciences. Taylor …  