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 on Trending Technologies
Technical articles with clear explanations and examples
C++ Program for Pigeonhole Sort?
Pigeonhole Sort is an example of the non-comparison sorting technique. It is used where the number of items and the range of possible key values is approximately the same.To perform this sort, we need to make some holes. The number of holes needed is decided by the range of numbers. In each hole, items are inserted. Finally deleted from the hole and stored into an array for sorted order.Pigeonhole sorting, also known as count sort, is a sorting algorithm that is suitable for sorting lists of elements where the number of elements (n) and the number of possible key values ...
Read MoreC/C++ Program for the Odd-Even Sort (Brick Sort)?
The odd-even sword also known as the brick sort is a similar sorting technique, like bubble sort. This sorting technique is subdivided into 2 phases odd phase and even phase, Both these phases simultaneously at every iteration until all the elements get sorted.The Odd phase of this programming technique works as a bubble sort but only on the elements that have an odd index.Similarly, the even phase works only on the elements that have an even index.For making this concept more clear let's take an example :Input: a[]={3, 5, 7, 6, 1, 4, 2} Output: 1 2 3 4 5 ...
Read MoreC/C++ Program for Number of solutions to Modular Equations?
We have an n number of coins and we have to French the coin way that it makeup Pyramid of maximum height. We will arrange the first coin in First row second and third coin in the second row and so onIn the given diagram, we make pyramid 6 of coins having a height of 3. We cannot make height 4 but we will need 10 coins. It is simple to get the height by using this formula;H = {(-1+ √(1+8N))/2}Input: n = 10 Output: Height of pyramid: 4ExplanationHeight by using this formulaH = {(-1+ √(1+8N))/2}Example#include #include using ...
Read MoreHTML DOM exitFullscreen() method
The HTML DOM exitFullscreen() method is used for getting an element currently in the full screen mode to get out of that mode. It does nothing if executed on an element that isn’t in the full screen mode already.SyntaxFollowing is the syntax for exitFullscreen() method −HTMLElementObject.exitFullscreen()ExampleLet us look at an example for the exitFullscreen() method − var docEle = document.documentElement; function GoNormal() { if (document.exitFullscreen) document.exitFullscreen(); } function GoFullscreen() { if (docEle.requestFullscreen) docEle.requestFullscreen(); } exitFullscreen() method example ...
Read MoreAddition of two number using ‘-‘ operator?
Operator overloading is an important concept in C++. It is a type of polymorphism in which an operator is overloaded to give user-defined meaning to it. The overloaded operator is used to perform the operation on the user-defined data type. For example, '+' operator can be overloaded to perform addition on various data types, like for Integer, String(concatenation), etc.Input10 20 20 30Output30 50ExplanationTo perform addition of two numbers using ‘-‘ operator by Operator overloading. Binary operators will require one object as an argument so they can perform the operation. If we are using Friend functions here then it will need ...
Read MoreAdd N digits to A such that it is divisible by B after each addition?
Given a, b and n. And we have to consider the following conditions and find the optimal solution to add n digits to a such that it is divisible by b after every iteration.Add a digit to a in such a way that after adding it, a is divisible by b.Print the smallest value of a possible after n iterations of step1.Print fail if the operation fails.check divisibility after every digit addition.Inputa=5 b=4 n=4Output52000ExplanationThe first digit to be added from 0 to 9, if none of the digits make a divisible by b then the answer is -1 which means the if n digits are ...
Read MoreC++ program to read file word by word?
In this section we will see how we can read file content word by word using C++. The task is very simple. we have to use the file input stream to read file contents. The file stream will open the file by using file name, then using FileStream, load each word and store it into a variable called word. Then print each word one by one.Algorithmread_word_by_word(filename)begin file = open file using filename while file has new word, do print the word into the console done endFile Content (test_file.txt)This is a test file. There are ...
Read MoreArea of a square inscribed in a circle which is inscribed in an equilateral triangle in C Program?
The program to find the area of a square inscribed in a circle which itself is inscribed in an equilateral triangle. The radius of circle inscribed inside an equilateral is a/(2√3).The diameter of circle is the diagonal of square, d = 2 * r = a/ √3 Area formula for area of square given its diagonals is ½ d2, A = 0.5 * d2 A = (1/2) * (a2) / (3) = (a2/6) Example#include using namespace std; int main() { float area,a = 10; area = (a*a) / 6; cout
Read MoreHTML DOM console.group() Method
The HTML DOM console.group() method is used to indicate the start of message group and all messages written after this method will be written inside the message group. This allows making one group for all messages or several groups using the label parameter.SyntaxFollowing is the syntax for the console.group() method −console.group([label])Here, label is an optional parameter. It is of type string and acts as a label for the message group created.ExampleLet us look at an example for the HTML DOM console.group() method − console.group() Method Press F12 key to view the message in the console view. NORMAL GROUP ...
Read MoreSuperperfect Number in C programming
The concept of super perfect number is similar to the perfect number. It was found by D Suryanarayana in 1969. He generalized the super perfect number as a number that satisfies the following formula :sig(sig(n)) = 2nHere, sig(n) is the function that calculates the sum of divisors of a number, it is also known as divisor summatory function.The following example with making this concept clear to you :we need to check if the number N is a superperfect number or not:N = 16OutputyesExplanation − to check whether a number is a perfect number or not we will find the sum ...
Read More