// Java program to Sort a Subarray in Descending order
// Using Arrays.sort()
// Importing Collections class and arrays classes
// from java.util package
import java.util.Arrays;
import java.util.Collections;
// Main class
public class GFG {
// Main driver method
public static void main(String[] args)
{
// Note that we have Integer here instead of
// int[] as Collections.reverseOrder doesn't
// work for primitive types.
Integer[] arr = { 13, 7, 6, 45, 21, 9, 2, 100 };
// Sorts arr[] in descending order using
// reverseOrder() method of Collections class
// in Array.sort() as an argument to it
Arrays.sort(arr, Collections.reverseOrder());
// Printing the array as generated above
System.out.println("Modified arr[] : "
+ Arrays.toString(arr));
}
}// Sort method
// const arr = [3,53,423,534,3];
// console.log(arr.sort());
// const names = ["fahad", "taha", "salman", "mojeeb"]; // This looks good but if we solve this sort this like with capital letters it'll give first priority to capital letter then it'll sort small letters the example is given below
// names.sort();
// console.log(names);
// Example
// const namesWithCapitalLetters = ["fahad", "Taha", "salman", "mojeeb"];
// namesWithCapitalLetters.sort();
// console.log(namesWithCapitalLetters);
// That's how it works :)
// How to get expected output
// const arr = [3,53,423,534,3];
// console.log(arr.sort()); ---> We're not getting expected output while we're doing this but there is a way with that we can get our expected output
// The way
const arr = [3, 53, 423, 534, 3];
console.log(arr.sort((a, b) => a - b));
// How this is working questing is this?
// What javascript here doing is first javascript 3 and 52 a = 3 b = 52; And now if we 3 to 52 and we'll get number greater than 0 then javascript sort those numbers in order of b then a ---> like 52, 3 and if we got the output less than 0 then javascript sort the number in order of a, b ---> 3 52 and yes you're right this is the correct output :)
// A use case of sort method
// Imagine you have a ecommerce site and you want to sort products prices then how can you sort the prices of products with sort method example given below
// Example
const userCart = [
{ producdId: 1, producdPrice: 355 },
{ producdId: 2, producdPrice: 5355 },
{ producdId: 3, producdPrice: 34 },
{ producdId: 4, producdPrice: 3535 },
];
// Use this for low to high
userCart.sort((a, b) => a.producdPrice - b.producdPrice);
// console.log(userCart)
// ===================================
// Use this for high to low
userCart.sort((a, b) => b.producdPrice - a.producdPrice);
// console.log(userCart)
// ==============The End=================//ascending order
let ArrayOne = [1,32,5341,10,32,10,90]
ArrayOne = ArrayOne.sort(function(x,y){x-y})
//descending order
let ArrayTwo = [321,51,51,324,111,1000]
ArrayTwo = ArrayTwo.sort(function(x,y){y-x}) int current = 0;
for (int i = 0; i < array.length ; i++) {
for (int j = i+1; j < array.length ; j++) {
if (array[i]>array[j]) {
current = array[i];
array[i] = array[j];
array[j] = current;
}
}
}var l = ["a", "w", "r", "e", "d", "c", "e", "f", "g"];
console.log(l.sort())
/*[ 'a', 'c', 'd', 'e', 'e', 'f', 'g', 'r', 'w' ]*/How does the following code sort this array to be in numerical order?
var array=[25, 8, 7, 41]
array.sort(function(a,b){
return a - b
})
I know that if the result of the computation is...
**Less than 0**: "a" is sorted to be a lower index than "b".<br />
**Zero:** "a" and "b" are considered equal, and no sorting is performed.<br />
**Greater than 0:** "b" is sorted to be a lower index than "a".<br />
Is the array sort callback function called many times during the course of the sort?
If so, I'd like to know which two numbers are passed into the function each time. I assumed it first took "25"(a) and "8"(b), followed by "7"(a) and "41"(b), so:
25(a) - 8(b) = 17 (greater than zero, so sort "b" to be a lower index than "a"): 8, 25
7(a) - 41(b) = -34 (less than zero, so sort "a" to be a lower index than "b": 7, 41
How are the two sets of numbers then sorted in relation to one another?
Please help a struggling newbie!
var carBrands = ["Toyota", "Jeep", "Ford", "Volvo"];
carBrands.sort();
// array.sort() method sorts an array in ascending order by default
// extend the function like below to sort in descending order or customize
//carBrands.sort(function(a, b){return b-a});//The sort() method sorts an array alphabetically:
const fruits = ["Banana", "Orange", "Apple", "Mango"];
fruits.sort();
//output >> [ "Apple",Banana","Mango", "Orange" ]
//if you find the answer is useful ,
//upvote ⇑⇑ , so can the others benefit also . @mohammad alshraideh ( ͡~ ͜ʖ ͡°)import java.util.Scanner;
public class ArraySorting {
public static int[] inputArray() {
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number of terms in the input array-");
int noOfTerms = sc.nextInt();
int[] array = new int[noOfTerms];
System.out.println("Enter the terms in the input array-");
for (int i = 0; i < noOfTerms; i++) {
array[i] = sc.nextInt();
}
return array;
}
public static int[] upSort(int[] b) {
// Ascending order
for (int i = 0; i < b.length - 1; i++) {
for (int j = 0; j < b.length - i - 1; j++) {
if (b[j] > b[j + 1]) {
// Swap elements if they are in the wrong order
int tmp = b[j];
b[j] = b[j + 1];
b[j + 1] = tmp;
// Comment: Elements swapped successfully
}
}
}
return b;
}
public static int[] downSort(int[] a) {
// Descending order
for (int i = 0; i < a.length - 1; i++) {
for (int j = 0; j < a.length - i - 1; j++) {
if (a[j] < a[j + 1]) {
// Swap elements if they are in the wrong order
int tmp = a[j];
a[j] = a[j + 1];
a[j + 1] = tmp;
// Comment: Elements swapped successfully
}
}
}
return a;
}
public static void printArray(int[] array) {
for (int element : array) {
System.out.print(element + " ");
}
}
public static void main(String[] args) {
int[] a = inputArray();
System.out.println("Array in ascending order:");
printArray(upSort(a));
System.out.println();
System.out.println("Array in descending order:");
printArray(downSort(a));
}
}// Java program to Sort a Subarray in Descending order
// Using Arrays.sort()
// Importing Collections class and arrays classes
// from java.util package
import java.util.Arrays;
import java.util.Collections;
// Main class
public class GFG {
// Main driver method
public static void main(String[] args)
{
// Note that we have Integer here instead of
// int[] as Collections.reverseOrder doesn't
// work for primitive types.
Integer[] arr = { 13, 7, 6, 45, 21, 9, 2, 100 };
// Sorts arr[] in descending order using
// reverseOrder() method of Collections class
// in Array.sort() as an argument to it
Arrays.sort(arr, Collections.reverseOrder());
// Printing the array as generated above
System.out.println("Modified arr[] : "
+ Arrays.toString(arr));
}
}