Sudhir sharma has Published 1149 Articles

Sum of series 2/3 – 4/5 + 6/7 – 8/9 + …… upto n terms

sudhir sharma

sudhir sharma

Updated on 19-Aug-2019 08:30:52

484 Views

A series is a sequence of numbers that have some common traits that each number follows. There are various series defined in mathematics with sum mathematical logic or mathematical formula. In this problem we are given a series of numbers 2/3 , -4/5 , 6/7 , -8/9 , …..The general ... Read More

Sum of series 1^2 + 3^2 + 5^2 + . . . + (2*n – 1)^2

sudhir sharma

sudhir sharma

Updated on 19-Aug-2019 08:27:31

245 Views

A series is a sequence of numbers that have some common traits that each number follows. These mathematical series are defined based on some mathematical logic like every number increases by the same interval( arithmetic progression), every number is increased by the same multiple( geometric progression), and many other patterns.To ... Read More

Bidirectional Search?

sudhir sharma

sudhir sharma

Updated on 19-Aug-2019 08:11:25

3K+ Views

A bidirectional search is a searching technique that runs two way. It works with two who searches that run simultaneously, first one from source too goal and the other one from goal to source in a backward direction. In in an optimal state, both the searches will meet in the ... Read More

C++ Bidirectional Iterators

sudhir sharma

sudhir sharma

Updated on 19-Aug-2019 08:07:41

295 Views

The iterators that have the privilege to access the sequence of elements of a range from both the directions that are from the end and from the beginning are known as bidirectional iterators. iterators can work on data types like list map and sets.Bidirectional iterators have the same properties as ... Read More

C++ Program for Pigeonhole Sort?

sudhir sharma

sudhir sharma

Updated on 19-Aug-2019 07:58:11

600 Views

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. ... Read More

C Program for Find the largest prime factor of a number?

sudhir sharma

sudhir sharma

Updated on 19-Aug-2019 07:55:07

5K+ Views

Prime Factor− In number theory, the prime factors of a positive integer are the prime numbers that divide that integer exactly. The process of finding these numbers is called integer factorization, or prime factorization.Example− Prime factors of 288 are: 288 = 2 x 2 x 2 x 2 x 2 ... Read More

Advantages of vector over the array in C++?

sudhir sharma

sudhir sharma

Updated on 19-Aug-2019 07:53:16

3K+ Views

Vector is a template class and is C++ only construct whereas arrays are built-in language construct and present in both C and C++.Vector are implemented as dynamic arrays with list interface whereas arrays can be implemented as statically or dynamically with primitive data type interface.Differences between a Vector and an ... Read More

C/C++ Program to find the Product of unique prime factors of a number?

sudhir sharma

sudhir sharma

Updated on 19-Aug-2019 07:45:29

610 Views

The unique prime factors is a factor of the number that is a prime number too. In this problem, we have to find the product of all unique prime factors of a number. A prime number is a number that has only two factors, the number and one.Here we will ... Read More

C/C++ Program to the Count set bits in an integer?

sudhir sharma

sudhir sharma

Updated on 19-Aug-2019 07:43:40

236 Views

Counting set bits means counting 1’S of the given integer. For this, we have multiple solutions that can be applied. For this case, we have a binary number( binary representation of an integer), for which we have to count the number of 1’s off the string.To count the number of ... Read More

C/C++ Program to the Count Inversions in an array using Merge Sort?

sudhir sharma

sudhir sharma

Updated on 19-Aug-2019 07:40:46

284 Views

The Count of inversions that take place to Sort the given array is known as inversion count. the inversion problem is a classical problem that can be solved using the merge sort Algorithm. in this problem v we will count all elements more than it to its left and add ... Read More

Advertisements