Issues to consider when using javascript Array.sort() across browsers_javascript skills

However, when doing cross-browser testing, a problem was discovered under the Chrome browser. The testers found (see Figure 1) that when sorting according to a certain column under Chrome, if the sorting values ​​​​of the two rows are the same, Chrome does not follow the normal situation. Keep the order of the two columns unchanged, but reverse their order. After googling the problem, we found that the original ECMAscript specification did not stipulate a specific sort algorithm, so each browser had its own sort algorithm. However, some manufacturers implemented it based on unstable sorting algorithms, such as chrome Sorting algorithms prior to Mozilla/Firefox 3.0 are unstable, but IE is a stable sorting algorithm. This difference in algorithm implementation also leads to inconsistent chart display results in different browsers.

                                                                                                                                                                                                                                   
After thinking about it for a while, another member of the group and I gave our own solutions. His opinion was to achieve unified control by implementing a specific sort algorithm by ourselves. In view of the fact that there are many ready-made sorting algorithms on the Internet and the sorting algorithm is For programmers, this method is not complicated to implement. The only work is to implement the code. But I think there is actually a simpler way, because our data is parsed from xml based on XSLT, and XSLT knows the serial number of each row of data (of course, it is the same if it is read from a database or webservice by server-side code It is easy to get this value), so I think you can add an Index attribute to each column in XSLT, e.g. Index=1 in the first row, Index=2 in the second row... In this way, if two are found when sorting to compare sizes If the values ​​are the same, compare their line numbers. In the end, you only need to add two lines of code to the comparison function to achieve this. The following is a screenshot of the implementation code and results:

Copy code The code is as follows:

var array = [

{Index:1,val:25},
{Index:2,val:25},
{Index:3,val:45},
{Index:4,val:78 }];
array.sort(function(a, b) {
if (a.val === b.val) {
//If the two values ​​here are the same, then according to their row number ( index value during initialization) for comparison. 0; i < array.length; i ) {
document.write("

" array[i].Index ":" array[i].val "

");
}




Screenshot of updated results:

Of course this is just one of the solutions. My purpose is just to minimize the amount of code we need to maintain, so as to minimize bugs. An idea, hope it helps you.

Frustration is like a wall, this wall forces us to prove to ourselves how much we desire the treasure behind this wall