Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles by Ravi Ranjan
Page 2 of 12
Binary Search on Singly Linked List in C++
In this article, we are given a sorted singly linked list, and our task is to search for a given node using a binary search algorithm. The binary search algorithm works on the divide-and-conquer principle as it keeps dividing the list in half before searching. To search for an element in the linked list using binary search, it should be sorted. In the sorted linked list, we find the middle node using two pointers (slow and fast) and compare it with the target node, and based on the comparison, we either search in the left or right sub-list or return ...
Read MoreBinary Search a String in C++
The binary search algorithm works on the divide-and-conquer principle as it keeps dividing the array in half before searching. To search for an element in an array using binary search, it should be sorted. In the sorted array, we find the middle element and compare it with the element that has to be searched, and based on the comparison, we either search in the left or right sub-array or return the middle element. In this article, we are given a sorted array of strings, and our task is to search for the given string using a binary search algorithm. ...
Read MoreC++ code to find minimum arithmetic mean deviation
The arithmetic mean deviation or mean absolute deviation is the summation of the absolute differences of each element and the mean of the dataset, then dividing it by the total number of data elements. To calculate the minimum arithmetic mean deviation, we used the median of the dataset in place of the mean. The formula to calculate the minimum arithmetic mean deviation is given as: $$ \text{MMD} = \frac{1}{n} \sum_{i=1}^{n} |x_i - M| = \frac{|x_1 - M| + |x_2 - M| + \cdots + |x_n - M|}{n} $$ Here are some example scenarios to calculate the ...
Read MoreArea of the Largest Triangle inscribed in a Hexagon in C++
In this problem, our task is to find the area of the largest triangle that can be inscribed in a regular hexagon. Each side of the hexagon and triangle is of length a and b, respectively. Area of the Largest Triangle Inscribed in a Hexagon You can calculate the area of the largest triangle inscribed in a regular hexagon using the following formula: $$ Area\ of\ triangle\ inside\ hexagon\ = \frac{3\sqrt{3}}{4} \cdot a^2 $$ Derivation The first step is to establish a relation between a and b, as the value of a(side of the hexagon) is ...
Read MoreArea of a square from diagonal length in C++
A diagonal of a polygon is the line joining two vertices that are not adjacent to each other. The formula for calculating the area of a square with diagonal length is a2 = d2 / 2, where a and d are the side and diagonal length of the square, respectively. The visual representation of the derivation of the formula is given below: Here are some example scenarios to calculate the area of a square from the diagonal length using the above formula: Scenario 1 Input: d = 10 Output: 50 Explanation: Using the formula: area = ...
Read MoreArea of a triangle inside a parallelogram in C++
The area of a triangle is given as (base * height) / 2, and the area of a parallelogram is base * height. For calculating the area of the triangle inside the parallelogram, we divide the area of the parallelogram by 2, i.e., (base * height) / 2, where the base and the height of the parallelogram are given. Here are some example scenarios to calculate the area of a triangle inside a parallelogram using the above formula: Scenario 1 Input: base = 10, height = 8 Output: 40 Explanation: Using the formula: Area ...
Read MoreArithmetic Mean in c++?
An arithmetic mean is the average of all the given numbers, which is calculated by summing all the numbers and dividing this calculated sum by the total number of elements. The formula for calculating the arithmetic mean is: $$ \bar{x} = \frac{1}{n} \sum_{i=1}^{n} x_i = \frac{x_1 + x_2 + x_3 + \cdots + x_n}{n} $$ Here, we are given an array of integers and our task is to calculate the arithmetic mean of these numbers using the above formula: Scenario 1 Input: num = 2, 7, 4, ...
Read MoreArray algorithms in C++ STL
The C++ STL or Standard Template Library is a collection of general-purpose classes and functions with templates for implementing many algorithms and data structures such as vectors, lists, queues, and stacks. The 4 components of STL are: Containers, Algorithms, Iterators, and Functors. In this article, we will discuss the functions of the header that work on arrays, and are introduced in C++ 11 and later versions. C++ Header The algorithm header provides various built-in functions that implement algorithms such as searching, sorting, finding the maximum element, etc. These functions perform various operations on containers such ...
Read MoreArranging Coins in C++
In this problem, we have n number of coins. To arrange these coins in a staircase shape such that each row consists of k number of coins, where k is the row number in which the coins are placed. The last row may or may not be completely filled. Our task is to find the number of completely filled rows. Here is a scenario of arranging coins problem: Scenario Input: n = 8 Output: 3 Explanation: In the above figure, we can see there are 3 completely filled rows and the ...
Read MoreAccessing array out of bounds in C/C++
An array in C/C++ is a fixed-size sequential collection of elements of the same data type where all the elements are stored in the contiguous memory allocation. If an array is accessed out of bounds then an undefined behavior will occur in C/C++, unlike Java where an exception such as java.lang.ArrayIndexOutOfBoundsException will occur. Accessing Out of Bound Memory Accessing out-of-bounds memory in an array means we are trying to access the array index outside its valid range size (i.e., index = array size). It returns any garbage value in the output. Example In ...
Read More