We have launched new website StudyGyaan where you can Get Programming Tutorials, Projects on different programming languages, and much more. Do visit our website. Click here for Projects. You can also contribute and publish your projects on StudyGyaan Contribution

Professional Cipher


Professional Cipher   Professional Cipher   Professional Cipher   Professional Cipher

Information Technology

Linear Search in Java Program

Linear Search is one of most simplest searching technique but it is not used widely because it is slower than Binary Search and Hashing.
Algorithm: Traverse the arrayMatch the key element with array elementIf key element is found, return the index position of the array elementIf …

Insertion Sort in Java Program

Insertion Sort is a sorting technique used for which sorting. Insertion Sort is good for small elements only because it requires more time for sorting large number of elements. There different kinds of sorting technique like Selection Sort and Bubble Sort.

A very good example of…

Java Program to remove duplicate element in an Array

Removing Duplicate elements from array is not difficult, just we have to concentrate on array index. We can remove duplicate elements from array in 2 way: using temporary array or using seperate index. For removing duplicate elements array must be sorted. You can use array.sort(…

Selection Sort Program in Java

Selection Sort is a sorting algorithm where an array is repeatedly finding the minimum  number or element from unsorted part(subarray) and putting it into sorted part(subarray).
Selection Sort maintains two subarray for sorting: First subarray is used for sorted elements andSecond…

Bubble Sort in Java Program

Bubble Sort is simplest sorting algorithm. In Bubble Sort, array is traversed from first element to last element. Here, current element is compared with the next element. If current element is greater than the next element, it is swapped.
This algorithm is not suitable for large…

Armstrong number program in Java

Armstrong number or  Narcissistic number is a positive number where the sum of cubes of every digit in number is equal to its original value. For example 0, 1, 153, 370, 371, 407 and so on.

Let's try to understand why 153 is an Armstrong number.

Example : 153 = (1*1*1)+(5*5*5…

Factorial in Java Program

Factorial of n is the product of all positive descending integers. Factorial of n is denoted by n!. For Example: Here, 4! is pronounced as "4 factorial", it is also called "4 bang" or "4 shriek".
The factorial is normally used in Combinations and Pe…

Palindrome in Java Program for String and Integer (Number)

A Palindrome is a word, number, or other sequence of characters which reads the same backward as forward, such as madam or 1002001.

Some of Palindrome's Strings we use in our daily life are:
Application of palindrome are in compression techniques, algo…

Finding Prime Number in Java Program

Prime number is a number where the number can be divided by 1 and/or itself only. Which means the number is not able to be divided by any numbers other than 1 and/or itself.  For example 2, 3, 5, 7, 11, 13, 17.... are the prime numbers.

Note: 0 and 1 are not prime numbers. The 2 …

Fibonacci Series in Java Program

In Fibonacci Series, next number use the sum of the previous two numbers. For example: 0, 1, 1, 2, 3, 5 , 8, 13, 21, 34, 55 and so on. Fibonacci series starts from 0 and 1.

Fibonacci application are in Stock Market, Trading, Banking Application, Data structure, Graphs and much m…