# Others

## Collection in Java2

Vector Vector uses dynamic array-type objects which are similar to the ArrayList. A vector is synchronized i.e., only one thread at a time can access them which differentiates them from the ArrayList which is not synchronized as multiple threads can access them at a time. Let’s look at an example program to understand vectors Stack …

## Collection in JAVA

In this article, we will be looking at the Collection in JAVA which is very useful for practicing DSA as it contains all types of data structures like Stacks, Queues, LinkedList, etc. The JAVA Collection is a framework that provides different data structures which can be operated upon. We can perform different operations like sorting, …

## 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 …

## Linear Search in DSA

INTRODUCTION In this tutorial, we are going to learn about a popular search algorithm, Linear Search in DSA. linear search. The linear search follows a sequential order in which searching for an element in an array starts from one end and continues to traverse towards another end of the array till the desired element is …

## 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 …

## TOWERS OF HANOI

INTRODUCTION In this tutorial, we are going to learn about the towers of Hanoi problem. The towers of Hanoi is a logical mathematical riddle that can be solved by recursion. In this, we have three rods (1,2, and 3) and n number of disks. The main objective of this towers of Hanoi is to move …

## FIBONACCI SERIES USING RECURSION

INTRODUCTION In this tutorial, we are going to calculate the FIBONACCI SERIES USING RECURSION. Generally, the Fibonacci series is a type of series where the current number in the series is the sum of the two numbers that precede it. The Fibonacci series usually starts with 0 and 1. each number in the Fibonacci series …