JavaScript ã§å®‰å®šã‚½ãƒ¼ãƒˆ - Qiita// デフォルトã®æ¯”較関数 function compare (a, b) { if (a === b) { return 0; } else if (a > b) { return 1; } else { return -1; } } function stableSort (array, fn) { if (fn == null) { fn = compare; } var i, len = array.length; if (len === 0) return array; // 値ã¨ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã®ãƒšã‚¢ã«ã™ã‚‹ for (i = 0; i < len; i++) { array[i] = [array[i], i]; } array.sort(function (p1, p2) { var cmp = fn(p1[0], p2[0]); if (cmp !== 0) { // ペアã®0
{{#tags}}- {{label}}
{{/tags}}