A complete thread on sort( ) method in JavaScript:๐งต
[2, 100, 70, 50].sort( )
โฉ
[100, 2, 50, 70]
Why?๐ญA
โฉ
[100, 2, 50, 70]
Why?๐ญA
๐ So, don't cry now in this thread we are going to see how the sort() method works behind the scenes.
๐ฏ My main focus is on how this "sort" method works behind the scenes.
๐ง In short, we are going to see multiple examples, so that you can easily understand.
let's go...๐ฅ
๐ฏ My main focus is on how this "sort" method works behind the scenes.
๐ง In short, we are going to see multiple examples, so that you can easily understand.
let's go...๐ฅ
๐ก Overview of sort( )
โ The sort method allows us to sort the elements of the array.
โ It changes the position of the elements in the original array, in other words, the sort method mutates the original array.
โ The sort method allows us to sort the elements of the array.
โ It changes the position of the elements in the original array, in other words, the sort method mutates the original array.
โ By default, it sorts the array items in ascending order, which means the smallest first and largest value will be the last one.
โ The sort method "typecasts" the elements into strings and compares the strings to determine the order of the elements.
โ The sort method "typecasts" the elements into strings and compares the strings to determine the order of the elements.
๐ก Example 1:
โ Suppose, if we want to sort only the "small" characters of the array, it will print as expected.
Right?๐
โ Suppose, if we want to sort only the "small" characters of the array, it will print as expected.
Right?๐
๐ก Example 2:
โ Now, if we want to sort only the "capital" characters of the array, it will also print the expected result.
Right?๐
โ Now, if we want to sort only the "capital" characters of the array, it will also print the expected result.
Right?๐
๐ก Example 3:
โBut what happens if we sort through the mixed cases of the characters?๐ค
โน๏ธ This time it's returned with an unexpected result.
Right?๐
โWho is the culprit here? Let's see an example. Then we will see the work behind the scene.
โBut what happens if we sort through the mixed cases of the characters?๐ค
โน๏ธ This time it's returned with an unexpected result.
Right?๐
โWho is the culprit here? Let's see an example. Then we will see the work behind the scene.
๐ก Example 4:
โ Suppose we want to sort an array that contains the number of elements.
โน๏ธ But this time it's also returned with an unexpected result.
Right?๐
Let's find out the culprit...๐
โ Suppose we want to sort an array that contains the number of elements.
โน๏ธ But this time it's also returned with an unexpected result.
Right?๐
Let's find out the culprit...๐
๐ค Culprit Of Example 3:
โ Actually, it is working just fine because it compares the ASCII(unicode value) of the letters.
๐ Have a look at the code snippet๐
โ The character code of "E" is the smallest in the array. That's why it will be sorted first, then U(85), and so on.
โ Actually, it is working just fine because it compares the ASCII(unicode value) of the letters.
๐ Have a look at the code snippet๐
โ The character code of "E" is the smallest in the array. That's why it will be sorted first, then U(85), and so on.
๐ค Culprit Of Example 4:
โ The above logic also applies here, so the character code of 0(48) is the smallest in the array. That's why it will sort first, then 1000(49), and so on.
๐ค But what is the solution?...
โ The above logic also applies here, so the character code of 0(48) is the smallest in the array. That's why it will sort first, then 1000(49), and so on.
๐ค But what is the solution?...
๐ก Solution: "compareFunction"
โ Yes, to resolve this problem we need to pass a "compareFunction" to the sort() method.
โ The sort( ) method accepts an optional argument which is a "compareFunction" that compares 2 elements of the array.
โ Yes, to resolve this problem we need to pass a "compareFunction" to the sort() method.
โ The sort( ) method accepts an optional argument which is a "compareFunction" that compares 2 elements of the array.
โ But, if we omit the "compareFunction" the sort() method sorts the elements on the basis of Unicode values.
โ The sort( ) method sorts elements on the basis of the returned value of the compare function.
โ The sort( ) method sorts elements on the basis of the returned value of the compare function.
๐ก Syntax of compareFunction:
โ The compare function also accepts 2 arguments, which are 2 continuous elements of the array.
โ Here, "a" and "b" are the 2 continuous elements of the array.
โ The compare function also accepts 2 arguments, which are 2 continuous elements of the array.
โ Here, "a" and "b" are the 2 continuous elements of the array.
๐ก Solution of Example 3:
1. We need to convert all elements in the same case.
2. Check,
๐ if "charCode of a" > "charCode of b" then return any positive value.
๐ if "charCode of a" < "charCode of b" then return any negative value.
๐ if same then return 0 means nothing.
1. We need to convert all elements in the same case.
2. Check,
๐ if "charCode of a" > "charCode of b" then return any positive value.
๐ if "charCode of a" < "charCode of b" then return any negative value.
๐ if same then return 0 means nothing.
Still do not understand?๐
Don't worry...
Just say "AAG LAGA DENGE AAG" ๐ฅ๐
Don't worry...
Just say "AAG LAGA DENGE AAG" ๐ฅ๐
๐ก Solution of Example 4:
โ a = 1st item
โ b = 2nd item
๐ Just we have to check:
โ if a > b = yes, then we need to SWAP, that's why we have to pass any +ve value.
โ if b > a = yes, then we don't need to SWAP, that's why we have to pass any -ve value.
โ a = 1st item
โ b = 2nd item
๐ Just we have to check:
โ if a > b = yes, then we need to SWAP, that's why we have to pass any +ve value.
โ if b > a = yes, then we don't need to SWAP, that's why we have to pass any -ve value.
โ else a === b, it will be the same number, we don't need to do anything.
๐ That's all ladies and gentlemen, that's it ๐งโ๐ป
๐ That's all ladies and gentlemen, that's it ๐งโ๐ป
๐ก Refactor the solution of Example 4:
Suppose,
๐ค a = 20 , b = 1000
โ If I subtract both of them, a - b = A negative number, right?
Now,
๐ค a = 1000, b = 500
โ If I subtract both of them, a - b = A positive number, right?
Suppose,
๐ค a = 20 , b = 1000
โ If I subtract both of them, a - b = A negative number, right?
Now,
๐ค a = 1000, b = 500
โ If I subtract both of them, a - b = A positive number, right?
And,
๐ค a = 500, b = 500
โ If I subtract both of them, a - b = 0, right?
๐ง So, can I replace the above logic with ๐ฎ - ๐ฏ?
Yes, we can do it ๐๐
๐ค a = 500, b = 500
โ If I subtract both of them, a - b = 0, right?
๐ง So, can I replace the above logic with ๐ฎ - ๐ฏ?
Yes, we can do it ๐๐
โ Finally, if you want to sort an array with descending order then you have to only change the order of the return value with ๐ฏ - ๐ฎ
๐ I hope you like my way of presenting the topics, so in return, I need your support by just following me and sharing it with your audience.
๐ I hope you like my way of presenting the topics, so in return, I need your support by just following me and sharing it with your audience.
That's all for now, we will meet in the next thread๐
๐ Follow Me @ATechAjay
For:
๐ Web Development
โจ JavaScript
โ๏ธ React JS
๐ Writing Skill
๐ฅ Motivation
๐น Growth
โ But Not For Only Resources & Shitpost ๐
Thank you so much for staying to the end of this thread๐
๐ Follow Me @ATechAjay
For:
๐ Web Development
โจ JavaScript
โ๏ธ React JS
๐ Writing Skill
๐ฅ Motivation
๐น Growth
โ But Not For Only Resources & Shitpost ๐
Thank you so much for staying to the end of this thread๐
Loading suggestions...