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
C++ Articles
Page 583 of 597
C++ Program to Find k Numbers Closest to Median of S, Where S is a Set of n Numbers
This is a C++ Program to find k numbers closest to Median of S, where S is a set of n numbers.AlgorithmsBegin function partition() for partitioning the array on the basis of values at high as pivot value: Arguments: a[]=an array. l=low H=high Body of the function: Declare variables pivot, in, i Initialize in = l Set pivot = h For i=l to h-1 if(a[i] < a[pivot]) swap a[i] and a[in]) increment in. ...
Read MoreC++ Program to Find ith Largest Number from a Given List Using Order-Statistic Algorithm
This is a C++ program to find ith largest number from a given list using Order-Statistic Algorithm.AlgorithmsBegin function Insert() to insert nodes into the tree: Arguments: root, d. Body of the function: If tree is completely null then insert new node as root. If d = tmp->data, increase the count of that particular node. If d < tmp->data, move the tmp pointer to the left child. If d > tmp->data, move the tmp pointer to the right child. End Begin ...
Read MoreC++ Program to Find the Mode in a Data Set
This is a C++ program to find the Mode in a data set.AlgorithmsBegin function insertinset() to insert data in the set. Create newnode and temp(t) node. Node to be inserted in the list using newnode. If head is null then assign new node to head and increase the count. During insertion perform insertion sort for sorting data. If the newnode->data is equal to any of the element present in the set, then just increment count. EndExample#include using namespace std; struct set // a structure set to declare ...
Read MoreC++ Program to Generate All Possible Combinations of a Given List of Numbers
This is a C++ program to generate all possible combinations of a given list of numbersAlgorithmsBegin Take the number of elements and the elements as input. function Combi(char a[], int reqLen, int s, int currLen, bool check[], int l) : If currLen>reqLen then Return Else if currLen=reqLen then Then print the new generated sequence. If s=l then Then return no further element is left. For every index there are two option: either proceed with a start as ‘true’ and recursively call Combi() with incremented value of ...
Read MoreC++ Program to Generate All Possible Subsets with Exactly k Elements in Each Subset
This is a C++ program to generate all possible subsets with exactly k elements in each subset.AlgorithmsBegin function PossibleSubSet(char a[], int reqLen, int s, int currLen, bool check[], int l): If currLen > reqLen Return Else if currLen = reqLen Then print the new generated sequence. If s = l Then return no further element is left. For every index there are two options: either proceed with a start as ‘true’ and recursively call PossibleSubSet() with incremented value ...
Read MoreC++ Program to Generate Random Partition out of a Given Set of Numbers or Characters
This is a C++ program to generate Random Partition out of a given set of numbers or characters.AlgorithmBegin Take the integers or characters as input. For choice 1: Take the input of the n integer array. Assign l = 0 to traverse the array. Using rand(), generate random integer partition of n. For each partition i, print next i integer from index value l. For choice is 2: Take the input of a string in ch[]. Calculate the length ...
Read MoreC++ program to Solve Tower of Hanoi Problem using Binary Value
This C++ program displays the solution to the Tower of Hanoi problem using binary value.There is one binary digit for each disk.The most significant bit represents the largest disk. A value of 0 indicates that the largest disk is on the initial peg, while a 1 indicates that it’s on the final peg.The bitstring is read from left to right, and each bit can be used to determine the location of the corresponding disk.The corresponding disk is stacked on top the previous disk on the same peg if a bit has the same value as the previous one.If it is ...
Read MoreC++ Program to Generate All Pairs of Subsets Whose Union Make the Set
This is a C++ program to generate all pairs of subsets, whose union make the Set.AlgorithmsBegin function UnionSet(): Arguments: a[] = an array. n = number of elements. Body of the function: 1) Generate binary code from 0 to 2^(n-1)-1 for all 2^(n-1) pairs. 2) Print the array element which has 0 or 1 in corresponding indexes in code string for each code. 3) Print them in a different set, which on the union of both sets gives the super set. EndExample#include #include #include using namespace std; void display(char code[], int a[], int n) //display the pairs { int i; cout
Read MoreC++ Program to Implement Treap
This is a C++ program to implement Treap. Treap data structure is basically a randomized binary search tree. Here, we shall consider insert, delete and search operations on this.Functions and descriptionsfunction rotLeft() for left rotationFirst rotate the tree then set new root.function rotRight() for right rotationFirst rotate the tree then set new root.function insetNod() to insert a given key into treap with priority recursively −If root = nullptr return data as root. If given data is less then root node, Insert data in left subtree. Rotate left if heap property violated. else Insert data in right ...
Read MoreC++ program to convert time from 12 hour to 24 hour format
This is a C++ program to convert time from 12 hour to 24 hour format.AlgorithmBegin In main(), If median = pm Check if entered hours is less than 12 Then add 12 to hours and print the time in 24 hours format. Check if entered hours is equal to 12 Then print “00” as hours and print the time in 24 hours format. Else If median=am Check if entered hours is less than 12 Then print ...
Read More