Swift 归并排序
发布时间:2020-12-14 06:39:39 所属栏目:百科 来源:网络整理
导读:用Swift写的一个归并排序算法(递归法) func Merge(sourceArray: NSMutableArray,tempArray: NSMutableArray,startIndex: Int,midIndex: Int,endIndex: Int) { var i = startIndex var j = midIndex + 1 var k = startIndex while(i != midIndex+1 j != endIn
用Swift写的一个归并排序算法(递归法)
func Merge(sourceArray: NSMutableArray,tempArray: NSMutableArray,startIndex: Int,midIndex: Int,endIndex: Int) { var i = startIndex var j = midIndex + 1 var k = startIndex while(i != midIndex+1 && j != endIndex+1) { let one = sourceArray[i] as! Int let two = sourceArray[j] as! Int if one >= two { tempArray.insertObject(sourceArray[j],atIndex: k) j += 1 k += 1 }else { tempArray.insertObject(sourceArray[i],atIndex: k) i += 1 k += 1 } } while(i != midIndex+1) { tempArray.insertObject(sourceArray[i],atIndex: k) i += 1 k += 1 } while(j != endIndex+1) { tempArray.insertObject(sourceArray[j],atIndex: k) j += 1 k += 1 } for i in startIndex...endIndex { sourceArray.replaceObjectAtIndex(i,withObject: tempArray[i]) } } func MergeSort(sourceArray: NSMutableArray,endIndex: Int) { var midIndex = 0 if startIndex < endIndex { midIndex = (startIndex + endIndex)/2 MergeSort(sourceArray,tempArray: tempArray,startIndex: startIndex,endIndex: midIndex) MergeSort(sourceArray,startIndex: midIndex+1,endIndex: endIndex) Merge(sourceArray,midIndex: midIndex,endIndex: endIndex) } }从小到大排列。 (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |