# Bouncy Number Program in Java1 min read

In his tutorial, we will learn how to write a java program to check bouncy number. Before we code, let us understand what is a bouncy number.

### Bouncy Number

A number is said to be a bouncy number if the digits of that number are in random order that is not sorted. Example: 121575, 521634, etc.

In other words, a number that is neither an increasing number nor a decreasing number is called a bouncy number.

• Increasing number: The number whose current digit is greater than or equal to the previous digit is called an increasing number. Example: 12345, 45678, etc.
• Decreasing number: The number whose current digit is less than the previous digit is called an decreasing number. Example: 54321, 98765, etc.

## Bouncy Number Program in Java

Output:

`//Run 1Enter the number: 1234512345 is NOT a Bouncy number//Run2Enter the number: 2356123561 is a Bouncy number`

### String Pattern Programs in C

In this tutorial, we will write various C pattern programs for String. Before that, you may go through the following topics in C. for loop …

### Java Program to Find pair of Integers in Array whose sum is given Number

In this tutorial, we will write a program to find a pair of elements from an array whose sum equals a given number in java …

### Program to Print Diamond Alphabet Patterns in C

In this tutorial, we will learn to write a C program to print Diamond patterns using alphabets/characters. However, in this tutorial, we will create a …

### Half Diamond Pattern in C using Alphabets

In this tutorial, we will learn and code the half diamond alphabet patterns in C programming language. However, in this tutorial, we will create a …

### Half Pyramid of Alphabets in C

In this tutorial, we will learn and code alphabet patterns in C programming language specifically the Half pyramid of alphabets in C programming. However, in …

### Inverted Half Pyramid Pattern of Alphabets in C

In this tutorial, we will write a C program to print half Pyramid using alphabets/characters. Before that, you may go through the following topic in …