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 1397 of 2109
Program for power of a complex number in O(log n) in C++
Given a complex number in the form of x+yi and an integer n; the task is calculate and print the value of the complex number if we power the complex number by n.What is a complex number?A complex number is number which can be written in the form of a + bi, where a and b are the real numbers and i is the solution of the equation or we can say an imaginary number. So, simply putting it we can say that complex number is a combination of Real number and imaginary number.Raising power of a complex numberTo raise ...
Read MoreBinary Search in C++ Standard Template Library (STL)
A binary search known as logarithmic search is a search algorithm that searches for an element in a sorted array. The algorithm recursively divides the array into two halves, if the element is found at the mid position then return otherwise call the divide and check again until the element is found.WorkingThe algorithm works by comparing the middle element of the sorted array with the element that is to be searched.If the search element is equal to the middle element, then return the index of the element.If the search element is greater than the middle element, search in the left ...
Read MoreBinomial Random Variables in C++
Random variables are those variables that are an outcome of the outcomes of a process that has the probability of giving rise to multiple outcomes. For example, The variable denoting head or tail as an outcome on tossing a coin is a random variable.A binomial random variable is a special type of random variable whose value is related to an event that has a fixed probability of an outcome in an event.There are certain properties that are possessed by a binomial random variable that makes it special. These are a must for a variable to become a binomial random variable ...
Read MoreMaximize elements using another array in C++
Problem statementGiven two arrays with size n, maximize the first array by using the elements from the second array such that the new array formed contains n greatest but unique elements of both the arrays giving the second array priority i.e. all elements of the second array appear before the first array. The order of appearance of elements should be kept the same in output as in inputIf arr1[] = {12, 15, 10} and arr2[] = {16, 17, 5} then {16, 17, 15} are the maximum elements from both array by maintaining order.Algorithm1. Create temporary array of size 2 * ...
Read MorePrint consecutive characters together in a line in C++
In this problem, we are given a string of characters and we have to print the same string in such a way that if two or more characters are consecutive then print them together in a single line otherwise print them in different lines i.e. with a line break.Let’s take an example to understand the concept better, Input : abcxstk Output : abc x st kExplanation − Since abc are in a sequence they are printed in a line. Then comes x which is not in sequence, so we add a linebreak here. Next is s which is not a ...
Read MorePrint common characters of two Strings in alphabetical order in C++
In this programming problem, we are given two strings. And we have to find all the characters of the string that are common in both the string and we have to print these common characters in alphabetical order. And print ‘NO COMMON CHARACTERS ’ found if no common letters arise. Given that the string does not contain all lower case alphabets.Let’s take an example −Input : string1 : adsfhslf string2 : fsrakf Output : affsExplanation − Between the two strings there are a, f, s. Hence the lexicographical output is ‘afs’.Input : string1 : abcde string2 : glhyte ...
Read MorePrint characters having odd frequencies in order of occurrence in C++
In this problem, we are given string str by the user. And we have to print only those characters whose frequencies of occurrence in an odd number.To solve this problem, we have to find the total frequency of occurrence of a character in a string. And print only those characters of the string that have odd frequencies of occurrence.Let’s take an example to understand the topic better −Input : adatesaas. Output : dteExplanation −The characters with their frequency of occurrence are −a4d1t1e1s2Characters with odd frequency are d, t, e.AlgorithmNow let's try to create an algorithm to solve this problem −Step ...
Read MorePrint Bracket Number in C++
In this problem, we are given expression. And we have to print the bracket number sequence. Let’s look at an example to understand the problem better.Example, Input : ((()())()) Output : 1233442551Explanation − Here we have encountered 5 bracket pairs and we have printed them in a sequence of their[ occurrence.Now since we know about the problem, let’s create a solution to this solution.The solution to this problem requires a stack data structure. We will use one variable that keeps the count of the number of left brackets and stack keeps track of right brackets. We will count left brackets ...
Read MorePrint bitwise AND set of a number N in C++
In this problem, we have to print all the numbers from 0 to n which are Bitwise AND of a binary of n.Let’s take an example to understand the concept better.Input : N = 4. Output : 0 4 Explanation : 0 & 4 = 0 1 & 4 = 0 2 & 4 = 0 3 & 4 = 0 4 & 4 = 4. Input : N = 6 Output : 0, 2, 4, 6To solve this problem, we need to use bitwise operators. Using these we will find the required subsets. We ...
Read MorePrint array of strings in sorted order without copying one string into another in C++
In the problem to print an array of strings in sorted order without copying one string into another, we need to sort the array of string. Here the programmer cannot copy a string into another string while sorting.Let’s take an example to understand the concept better :Example −Input : {“Delhi”, “Hyderabad”, “Indore”, “Mumbai”, “Banglore”} Output : Banglore, Delhi, Hyderabad, Indore, MumbaiExplanation − Lexicographically the ordering is done. So, Bangalore starting with B comes first and Mumbai starting with M comes last.Now, let's try to derive a solution to our problem.To solve the problem, we can create an array that stores the ...
Read More