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
-
Economics & Finance
Server Side Programming Articles
Page 1509 of 2109
C++ Program to find kth Smallest Element by the Method of Partitioning the Array
In this articles we will find the kth Smallest Element by Partitioning the Array in C++, let's see input/output scenario: Input / Output Scenario Following is the input-output scenario: Input: arr[] = {7, 2, 1, 6, 8, 5, 3, 4} Output: 3 In the above scenario, after sorting the array, it becomes {1, 2, 3, 4, 5, 6, 7, 8}, so the kth smallest element is 3. An array is a linear data structure that is a collection of elements of the same type in a contiguous memory location. So, to partition a given array, we need to use ...
Read MoreC++ Program to find the median of two sorted arrays using binary search approach
The median is defined as the middle value of a sorted list of numbers, and the middle value is found by ordering the numbers in ascending order. Once the numbers are ordered, the middle value is called the median of the given data set. Here, in this article, we have two different sorted arrays and need to find the median of these two array using binary search. Median depends on the sorted combined array. So, the following cases may occur: If the length of the combined array is odd, then the median should be the ...
Read MoreC++ Program to find the maximum subarray sum O(n^2) time (naive method)
A subarray is a contiguous slice of an array, and maintains the order of elements naturally. (i.e., the elements of the subarray occupy consecutive positions). For example, the subarrays of an array {1, 2, 3} are {1}, {1, 2}, {1, 2, 3}, {2}, {2, 3}, and {3}. Input / Output Scenario Let's see the following input/output scenario: Input: arr[] = {1, 4, 5, 3, -1} Output: 13 Explanation: Subarray {1, 4, 5, 3} has the maximum sum 13. Input: arr[] = {1, 2, -3, 4, 5, -1} Output: 9 Explanation: Subarray {1, 2, -3, 4, 5} has the ...
Read MoreDifference Between Copy Constructor and Assignment Operator in C++
A copy constructor is a type of constructor that uses another object from the same class that has been created previously, to initialize an object, whereas the assignment operator is used to assign a value to a variable. In this article, we will understand the difference between the copy constructor and the assignment operator in C++. Copy Constructor A copy constructor creates a new object by copying an existing object of the same class which has been created previously. It is of two types, i.e., Default and User-defined copy constructor. In the default copy constructor, ...
Read MoreWhy should I not #include \'bits/stdc++.h\'?
The is a header file that includes all the standard C++ library. It is used during coding contests, as it helps in saving time while solving the problem since programmers do not have to remember all the header files. In the software engineering approach, we should reduce the use of this header file, as it includes lots of files, and sometimes that may not be required in the program. So it may increase the compile time. In this article, we are going to discuss why we should not use the header file ...
Read MoreC++ Program to Store and Display Information Using Structure
A structure is a collection of items of different data types. It is very useful in creating complex data structures with different data type records. A structure is defined with the struct keyword. In this article, we will store and display information of an employee using a structure. An example of a structure is as follows: struct employee { int empID; char name[50]; int salary; char department[50]; }; Store Information in Structure and Display It In this program, we store and display employee information using a ...
Read MoreC++ Program to Perform Preorder Recursive Traversal of a Given Binary Tree
In this article, we'll show you how to write a C++ program to perform a preorder recursive traversal of a binary tree. A binary tree is a tree where each node has zero, one, or two children. Even an empty tree is called a valid binary tree. Traversal means visiting all the nodes in a tree exactly once. In preorder traversal, we visit the root first, then the left child, and finally the right child. Let's take a small binary tree and see an example: Here, we start at the root(3), then go to the left child (6), ...
Read MoreC++ Program to Perform Inorder Recursive Traversal of a Given Binary Tree
Tree traversal is a form of graph traversal. It involves checking or printing each node in the tree exactly once. The inorder traversal of a binary tree involves visiting each of the nodes in the tree in the order (Left, Root, Right). An example of Inorder traversal of a binary tree is as follows. Here, we start at the leftmost node(5), move up to 6, then to 2, then to root 3, and continue to the right side with 9 then 4 and 8. Using Recursion for Inorder Traversal Recursion is a technique where a function ...
Read MoreC++ Program to Perform Right Rotation on a Binary Search Tree
Binary Search Tree (BST) is a special binary tree in which the left subtree of a node contains only nodes with values less than the node's value, and the right subtree contains only nodes with values greater than the node's value. In this article, we will learn how to perform a right rotation on a BST node using C++. What is Right Rotation in BST? Right rotation is a type of tree rotation technique that is used to balance a binary search tree. In the right rotation around a node, the node is moved to the right in such ...
Read MoreC++ Program to Perform Postorder Non-Recursive Traversal of a Given Binary Tree
Binary Tree traversal is a process of visiting all the nodes in a certain order. In this article, we will learn how to perform postorder non-recursive traversal of a binary tree using two stacks in C++. What is Postorder Non-Recursive Traversal? Postorder traversal is a type of depth-first traversal where we first visit the left subtree, then the right subtree, and then the root node. In a non-recursive approach, we are not allowed to use recursive functions to track nodes for traversing the tree. Instead, we can use stack data structures to manually keep track of the nodes. This ...
Read More