GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - Meniny/SortAlgorithm: 🛂 Swift array sort algorithm implementation.

BranchesTags
Open more actions menu

Latest commit

 

History

8 Commits
8 Commits

Folders and files

NameName
Last commit message
Last commit date
Sample
Sample
 
 
SortAlgorithm
SortAlgorithm
 
 
.gitignore
.gitignore
 
 
LICENSE.md
LICENSE.md
 
 
Package.swift
Package.swift
 
 
README.md
README.md
 
 
SortAlgorithm.podspec
SortAlgorithm.podspec
 
 

Repository files navigation


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 5

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))")

About

🛂 Swift array sort algorithm implementation.

Topics

algorithmsortsort-algorithmswift

Resources

Readme
MIT license
Activity

Stars

5 stars

Watchers

2 watching

Forks

1 fork
Report repository

Releases

Packages

Contributors

Languages

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.