C++ Programming
Print all Permutations of given String: using C++
What do permutations mean? Permutation is defined as "various arrangements produced out of a certain number of things by taking some or all of them." For instance, the permutation of the three letters abc is: ab, ba, bc, cb, ac, ca. In coding contests and various placement exams, strings are
Initializing Vectors in C++
Introduction A dynamic array with auto-scaling capabilities is known as a C++ vector. An element is added to or removed from the vector before the resizing takes place. The container manages the storage automatically. A vector's elements are kept together in contiguous storage. This makes it possible for C++ programmers
Binary Tree Code Implementation
Introduction Do you know what a binary is? How can we implement binary trees in our favorite programming language? Then don't worry, dear, when Board Infinity is here. In this article, we will discuss each and everything about the binary tree. We will also look at its implementation and its
List in C++
Introduction The term "storage container" in C++ refers to the std::list. You can add and remove things from the std:list from any location. A doubly-linked list is used to implement standard::list. This indicates that bi-directional and sequential access to list data is possible. The STL (Standard Template
Graphs in Data Structure and Algorithm
In this article, we will discuss graph data structure and algorithms. A graph is a non-linear data structure that consists of nodes or vertices. These vertices may or may not be connected with lines known as edges. In simple words, we can say that a graph is a collection of
Stack in Data Structure
Introduction A stack is a linear data structure in which operations are done in a specific order. The order might be LIFO (Last In, First Out) or FILO (First In, Last Out). Stack example There are numerous real-world examples of stacks. Consider the canteen, where plates are heaped on top
Trie Data Structure: Explanation and Examples
What is Trie? Trie is a sort of k-ary search tree that is used to store and search for a certain key in a set. Search complexity can be reduced to an ideal level using Trie (key length). A well-balanced BST will require time proportional to M * log N if
Big O Notation: Space and Time Complexity
Introduction Analysis of the runtime of the algorithm is performed in three ways they are Big O notation, Theta notation, and Omega notation. This article mainly explains Big O notation. It is the worst-case time complexity of the algorithm. It is calculated when huge inputs are given to the computer
Rabin Karp Algorithm: C++ Implementation
Introduction * While it's easy to spot patterns in a string with the naked eye, what if you wanted to use a computer program to detect those same patterns? Well, a Rabin-Karp algorithm can help with that. * Using a hash function, the Rabin-Karp algorithm is used to identify patterns in a
Static variables in C++
We will understand static variables along with its applications and use cases in C++ using examples in this article.
What is a Static Variable?
A var becomes a static variable if the static keyword was used before its definition.
Syntax
static
