How to sort integer array in Java ? - Ascending/Descending order ? Java tutorial for beginners !

[@dreamdot9686]

Hello Guys , We are a team of software professionals working for top MNC's and product companies . If you are interested in having one to one online classes for learning Java or Python programming please reach us at [e-mail] . Our classes will be completely practical which will help you to crack Interviews and work better in IT industry .

[@3ndclo181]

Hi, are you still doing this?

[@Barak_Mozes]

The code you provided is almost correct !
public static void sortArray(int[] array) {
int temp;
for (int i = 0; i < array.length - 1; i++) {
for (int j = i + 1; j < array.length; j++) {
if (array[i] > array[j]) {
temp = array[i];
array[i] = array[j];
array[j] = temp;
}
}
}
}

[@alexjeffin1186]

so to call that method do i just write this
sortArray(v)
v is an array and do I need to put it in a for loop or just like that?

[@gamingwithjeevu7069]

Guys if you want to do it without so much trouble you can either use Arrays.sort()-->it arrange the array in ascending order
Ex:
int[] arr ={22,11,33,1};
Arrays.sort(arr);
System.out.println(Arrays.toString(arr);
Output-->[1,11,22,33]
Or else you can just write the code given in the video it will help you as u might have to arrange the array in the descending order.

[@Hompuu]

Looked so long for how to sort in descending order, you saved me, thanks sir!!

[@dreamdot9686]

My pleasure dude .. Happy learning ! If you wish to have one to one java classes any time in your career .. Don't forget to contact us at [e-mail]

[@PS-on1nh]

Bro ur video very useful,pls upload video for
Ques is:merge two arrays and sort the array in ascending and remove the duplicate elements from the array in one program
A[ ]={2,3,1,4,5,6,7};B[ ]={7,10,8,6,8,6,9}

[@karthickhkmy6835]

can you explain the backend logic for this program?

[@yazharasan2997]

5:30 must

[@C.Sakthivignesh]

Thanks sir for made this video.

[@dreamdot9686]

Our pleasure

[@elroysamu]

thank you. what is the name of this algorithm

[@charityg4786]

great explanation,but why didn't you start j at i+1? considering you are not comparing the first element with itself.

[@dreamdot9686]

Valid point mate .. we can very well do it ..

[@Raven-ql3im]

That's also my question, I've also seen it but what is the difference between j=i+1 and j=1 ?

[@abhishekchakrabarty2930]

@@dreamdot9686 sir I did too..the end test cases are showing time limit exceed when some large arrays are given as input

[@gra_nn]

@@Raven-ql3im j = j+1 starts comparing i with the next element directly and what j=1 does is that it makes it first compare i to itself then move on to the next element. Both cases work since our condition is > and not >=

[@ABHAYSINGH-op2rm]

Because by doing j=i+1 you will not traverse all the elements all the time. So we have to put j=i

[@guna_777]

tnx way too much helpfull :)

[@dreamdot9686]

Appreciate your comments

[@FoodieSanjana]

Hi... Can you please explain what you used in for loop to print the sorted array..

[@dreamdot9686]

Concept is to compare each element of the array with all other elements and swap them if it is greater or smaller based on the order .. if we continue doing it .. at the end you ll get sorted array .. check the video as I have step by step explanation .. please write to us for any further questions

[@dreamdot9686]

Hello Guys , We are a team of software professionals working for top MNC's and product companies . If you are interested in having one to one online classes for learning Java programming please reach us at [e-mail] . Our classes will be completely practical which will help you to crack Interviews and work better in IT industry .

[@thuppadalokanath5444]

thank you sir 😍

[@kulbhushankumar4438]

Good mornig sir

[@sforsuraj7255]

Thank You sir

[@dreamdot9686]

Our pleasure

[@brilliantdecember]

Thanks for this!

[@dreamdot9686]

Our pleasure !

[@neslinkaragoz]

this was great! Thank You

[@Bleedpool]

Thank you

[@cabdallacali9326]

this video is so help ful thank you pro

[@dreamdot9686]

Our pleasure bro .. Anytime if you wish to have one to one java classes don't hesitate to contact [e-mail]

[@osa-_-]

5:42

[@commercial3750]

This video was so helpful. Thank you!

[@dreamdot9686]

Our pleasure.. Anytime if you wish to have one to one java classes don't hesitate to contact [e-mail]

[@reubenamantemallorca915]

very helpful

[@dreamdot9686]

Thanks

[@loisarcangeles3954]

Great video! but may I ask if what was the point of this code
temp=num[i];
num[i]=num[j];
num[j]=temp;

[@dreamdot9686]

This code will swap the values in i'th and j'th position using a temporary variable

[@Xpert599]

What id love to know is why do people refer to using the merge sort algorithm when something like this is so much simpler and less coding overall. What’s so special about merge sort???

[@dreamdot9686]

It could be the execution time .. normally when choosing an algorithm for sorting we should rely on efficiency . May be you can compare the time difference between these 2 algos ..

[@hey-uo2ru]

Exactly my idea at first to do this but failed then looked it up

[@dreamdot9686]

Well done

[@pedromoreira1311]

Nice job, the best and the simplest code.

[@dreamdot9686]

Thanks mate

[@dreamdot9686]

Hello Guys , We are a team of software professionals working for top MNC's and product companies . If you are interested in having one to one online classes for learning Java programming please reach us at [e-mail] . Our classes will be completely practical which will help you to crack Interviews and work better in IT industry .

[@utkarshgupta6091]

bro can we use Arrays class methods for solving such questions in interview? As Arrays class has direct sort method. And can we use collections for solving interview questions?

[@dreamdot9686]

Hi .. we shouldn't use inbuilt functions for solving such problems .. companies will try to test your logical thinking in programs .. so always write your logic and avoid using inbuilt functions

[@antonignatenko7776]

I was tasked to fill an array with random numbers and then check if its in increasing order or not how do i simply check for an order? Thanks

[@dreamdot9686]

To check if the elements are in increasing order .. you can iterate through the array and compare every i th element with i+1 th element..

[@phxgaming5684]

Is this binary sort?

[@dreamdot9686]

This is selection sort

[@abhisheksingh2520]

Can we give this example in bubble sort??

[@dreamdot9686]

Yess .. it's selection sort .. if possible ll share video on bubble sort soon

[@kulbhushankumar4438]

Sir app jis pr coding kr rha ho bo bali link chiya mujhe

[@MuhammadTalha-ui1qd]

take and array from the user and sort it in assending order and then calculate its median and mode
any one solve this rapidly

[@dreamdot9686]

Hello Guys , We are a team of software professionals working for top MNC's and product companies . If you are interested in having one to one online classes for learning Java programming please reach us at [e-mail] . Our classes will be completely practical which will help you to crack Interviews and work better in IT industry .

[@jeanrodrigues6249]

KVM

[@rezaarian237]

shouldn't be i+1? otherwise, you are saying 44 > 44?

[@dreamdot9686]

Yep you can very well do that ... It's a miss from my end

[@ritikaluthra5161]

Sir ap program konse software m krte h

[@dreamdot9686]

You can use any code editor which supports java .. I have used eclipse IDE

[@Wasim0090]

👍

[@dreamdot9686]

😀

[@mra9905]

font name?

[@jeanrodrigues6249]

KDE

[@MGwithAI]

Which sorting is this

[@dreamdot9686]

Bubble sort

[@dreamdot9686]

Hello Guys , We are a team of software professionals working for top MNC's and product companies . If you are interested in having one to one online classes for learning Java programming please reach us at [e-mail] . Our classes will be completely practical which will help you to crack Interviews and work better in IT industry .

[@mra9905]

font name?