🛂 Swift array sort algorithm implementation.
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Sample
SortAlgorithm
.gitignore
.swift-version
LICENSE
Package.swift
README.md
SortAlgorithm.podspec

README.md


Version Author Build Passing Swift
Platforms MIT
Cocoapods Carthage SPM

Introduction

What's this?

SortAlgorithm is a Swift array sort algorithm framework.

Requirements

  • iOS 8.0+
  • tvOS 9.0+
  • macOS 10.9+
  • watchOS 2.0+
  • Xcode 9 with Swift 4

Installation

CocoaPods

pod 'SortAlgorithm'

Contribution

You are welcome to fork and submit pull requests.

License

SortAlgorithm is open-sourced software, licensed under the MIT license.

Sample

// Randome Array
let original = [Int].init(repeating: 0, count: 5000).map { $0 + Int(arc4random_uniform(5000)) }
let closure: Array<Int>.SortingCompareClosure = { (l, r) -> Bool in
    return l < r
}
// Now sort
print("Bubble: \n\(original.bubbleSort(by: closure))")
print("\n\n======\n\n")
print("Insertion: \n\(original.insertionSort(by: closure))")
print("\n\n======\n\n")
print("Merge: \n\(original.mergeSort(by: closure))")
print("\n\n======\n\n")
print("Quick: \n\(original.quickSort(by: closure))")
print("\n\n======\n\n")
print("Counting: \n\(original.countingSort())")
print("\n\n======\n\n")
print("Heap: \n\(original.heapSort(by: closure))")