xxxxxxxxxx
import java.util.Scanner;
public class DigitOrderChecker {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Enter an integer number: ");
int number = input.nextInt();
int prevDigit = number % 10;
number /= 10;
boolean ascending = true;
boolean descending = true;
while (number > 0) {
int currentDigit = number % 10;
if (currentDigit >= prevDigit) {
descending = false;
}
if (currentDigit <= prevDigit) {
ascending = false;
}
prevDigit = currentDigit;
number /= 10;
}
if (ascending) {
System.out.println("Ascending order");
} else if (descending) {
System.out.println("Descending order");
} else {
System.out.println("Not in an order");
}
input.close();
}
}
xxxxxxxxxx
function solution(n) {
return parseInt(n.toString().split('').sort((val1,val2) => val2-val1).join(''));
}
xxxxxxxxxx
// functions to return the ascending and descending
const getAscendingData = (arr, field) => {
// Because localeCompare will work only if the field is string if your input is only alphabets then remove the else statement
if(typeof(val) === 'string') {
return arr.sort((a, b) => a[field].localeCompare(b[field]));
} else {
//this will return us the number ascending orders, but won't work on alphabets
return arr.sort((a, b) => (a[field] > b[field] ? 1 : -1))
};
}
const getDescendingData = (arr, field) => {
return arr?.sort((a, b) => (a[field] > b[field] ? -1 : 1));
};