Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
The array is a collection of elements of the same data type stored in continuous memory locations.C++ standard library contains many libraries that support the functioning of arrays. One of them is an array data() method.The array data() in c++ returns a pointer pointing to the first element of the object.Syntaxarray_name.data();ParameterThere are no parameters accepted by the function.Return typeA pointer to the first element of the array.ExampleProgram To Illustrate The Use Of Array Data() Method − Live Demo#include using namespace std; int main(){ array percentage = { 45.2, 89.6, 99.1, 76.1 }; cout
An array is a collection of elements of the same data type stored in continuous memory locations.In c++ standard library (STL) there are a lot of methods to support the functioning of the array. One of them is an array at() method.The array at() method is used to return the reference of the element at a specific index value.SyntaxThe general syntax for array at() function isarray_name.at(i);ParametersThe function accepts a single parameter which I the index of the element which is to be accessed using the function.ReturnsThe function returns the element whose index is passed at the time of calling it. ... Read More
A complex number is a number that is expressed in the form of a + bi, where a and b are real numbers. i is the imaginary part of number.The argument is the angle between the positive axis and the vector of the complex number. For a complex numberz = x + iy denoted by arg(z), For finding the argument of a complex number there is a function named arg() of a complex number in the complex header file.Syntaxarg(complex_number);ParameterThe function accepts a complex number as input to calculate the value of the argument for that complex number.Returned valueThe function returns ... Read More
The array is a collection of a fixed number of items of the same data type. These elements are stored in contiguous memory locations in the memory.Every single element of the value can be accessed from its index value using the brackets “[]” and the array name like a[4], a[3], etc.Declaring ArraysIn c/c++ programming languages, arrays are declared by defining the type and length (number of elements) of the array. The below syntax show declaration of an array in c/c++ −data_tpye array_name[length];For example, declaring an array of type float named the percentage of length 10.float percentage[10]Initializing array valuesIn c++ programming ... Read More
The arithmetic number is a number which has the average of all positive divisors is an integer i.e. for a number n if the number of divisors can divide the sum of divisors then n is an arithmetic number.Let’s take an example to understand the concept better, Input : n = 6 Output : YES Explanation : Divisors are 1 , 2 , 3 , 6 Sum = 1+2+3+6 = 12 Number of divisors = 4 Sum of divisors / number of divisor = 12 / 4 = 3AlgorithmStep 1 : Calculate the sum of divisors and store into sum ... Read More
n-sided regular polygon is a closed figure of n sides that has all sides and angles of equal length. The below figure shows a 6 sided regular polygon commonly known as hexagon.Apothem is a line in the polygon that connects the center of the figure to the side. And it is perpendicular to one of its sides that makes it smallest in length.Now, let drive the formula for its length.The angle made by the side of an n sided polygon is 360/n.Now, as in the figure, the angle is equal to (360 / n )/2 = 180 /nNow taking the ... Read More
Time complexity can be defined as the time required by the algorithm to run its average case.Let's see and calculate the time complexity of some of the basic functions.Methodvoid counter(int n){ for(int i = 0 ; i < n ; i++){ for(int j = 1 ; j
A linked list is a data structure that stores data elements in linked form. Each node of the linked list has a data element and a link.Print reverse of a linked list is a common problem that needs to be addressed in problem solving. So, here we will learn an interesting way to print reverse of a linked list in c++ programming language.Generally print a reverse linked list needs modifications in the list or multiple traversing of the list but this method does not require any such things and also traverses the linked list only once.The logic of this method ... Read More
What is the time complexity of insertion sort?Time complexity is the amount of time taken by a set of codes or algorithms to process or run as a function of the amount of input.For insertion sort, the time complexity is of the order O(n) i.e. big O of n in best case scenario. And in the average or worst case scenario the complexity is of the order O(n2).What will be the time complexity of sorting when insertion sort algorithm is applied to n sized array of the following form: 6, 5, 8, 7, 10, 9 …… I, i-1The time complexity ... Read More
Amortized analysis for a sequence of operations is used to determine the run time, the average time required by the sequence. In cannot be treated as an average-case analysis done on the algorithm as it does not always take the average case scenario. There are cases that occur as a worst-case scenario of analysis. So, amortized analysis can be treated as a worst-case analysis for multiple operations in a sequence. Here, the cost of doing each operations in different and for some its high. This problem is a general view using the binary counter.Let’s see the working and implementation in ... Read More