如何快速稳定地对数组排序? [英] How to stable sort an array in swift?

问题描述

我一直在使用sort()函数，但它混合了相对顺序.

I've been using the sort() function but it mixes up the relative order.

这是我的代码的外观.

This is how my code looks.

recipes.sort { $0.skill.value <= $1.skill.value }

Swift API 表示:

排序算法不稳定.不稳定的排序可能会改变 比较相等的元素的相对顺序.

The sorting algorithm is not stable. A nonstable sort may change the relative order of elements that compare equal.

如何更改此设置，以使相对顺序保持与以前相同?

How can I change this so that the relative order stays the same as before?

推荐答案

let sortedArray = (recipes as NSArray).sortedArray(options: .stable, usingComparator: { (lhs, rhs) -> ComparisonResult in
    let lhs = (lhs as! Recipe)
    let rhs = (rhs as! Recipe)
    if lhs.skill.value == rhs.skill.value {
        return ComparisonResult.orderedSame
    } else if lhs.skill.value < rhs.skill.value {
        return ComparisonResult.orderedAscending
    } else {
        return ComparisonResult.orderedDescending
    }
})

从此处获取: https://medium.com/@cocotutch/a-swift-sorting-problem-e0ebfc4e46d4

这篇关于如何快速稳定地对数组排序?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！