Skip to content

Solutions for assignment #4 - Quick Sort #37

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: assignment004
Choose a base branch
from
Open

Solutions for assignment #4 - Quick Sort #37

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 23 additions & 15 deletions ...s/Sorting/QuickSort.playground/Pages/Quicksort Functional.xcplaygroundpage/Contents.swift
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,24 +10,32 @@ func swiftyQuickSort<T>(var array: [T], _ isOrderedBefore: (T, T) -> Bool) -> [T
guard array.count > 1 else {
return array
}

return array

let pivot = array.removeLast()
let lowers = array.filter { isOrderedBefore($0, pivot) }
let greaters = array.filter { isOrderedBefore(pivot, $0) }

let pivotsCount = array.count - lowers.count - greaters.count + 1
let pivots = [T](count: pivotsCount, repeatedValue: pivot)

return swiftyQuickSort(lowers, isOrderedBefore) + pivots + swiftyQuickSort(greaters, isOrderedBefore)
}

//let array1 = [1]
//assert(swiftyQuickSort(array1, <) == [1])
//
//let array2 = [Int]()
//assert(swiftyQuickSort(array2, <) == [])
//
//let array3 = ["c", "d", "b", "a"]
//assert(swiftyQuickSort(array3, <) == ["a", "b", "c", "d"])
//
//let array4 = [3, 0, 2, 1, 2, -1]
let array1 = [1]
assert(swiftyQuickSort(array1, <) == [1])

let array2 = [Int]()
assert(swiftyQuickSort(array2, <) == [])

let array3 = ["c", "d", "b", "a"]
swiftyQuickSort(array3, <)
assert(swiftyQuickSort(array3, <) == ["a", "b", "c", "d"])

let array4 = [3, 0, 2, 1, 2, -1]
//assert(swiftyQuickSort(array4, <) == [-1, 0, 1, 2, 2, 3])
//
//let array6 = [5, 1, 2, 3]
//assert(swiftyQuickSort(array6, >) == [5, 3, 2, 1])

let array6 = [5, 1, 2, 3]
assert(swiftyQuickSort(array6, >) == [5, 3, 2, 1])
/*:
[Table of Contents](Table%20of%20Contents) | [Previous](@previous) | [Next](@next)
*/
190 changes: 119 additions & 71 deletions ...nts/Sorting/QuickSort.playground/Pages/Quicksort In-place.xcplaygroundpage/Contents.swift
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,27 +10,37 @@ Implement [Lomuto's partition algorithm]( https://en.wikipedia.org/wiki/Quicksor

func lomutoPartition<T>(inout array: [T], low: Int, high: Int, @noescape _ isOrderedBefore: (T, T) -> Bool) -> Int {
let pivot = array[high]
var i = low

// ...

return 0
for j in low...high-1 where isOrderedBefore(array[j], pivot) {
if (i != j) {
swap(&array[i], &array[j])
}
i += 1
}

if (i != high) {
swap(&array[i], &array[high])
}

return i
}

//var lomutoArray1 = [2, 1, 4]
//assert(lomutoPartition(&lomutoArray1, low: 0, high: lomutoArray1.count-1, <) == 2)
//assert(lomutoArray1 == [2, 1, 4])
//
//var lomutoArray2 = [2, 1, 0]
//assert(lomutoPartition(&lomutoArray2, low: 0, high: lomutoArray2.count-1, <) == 0)
//assert(lomutoArray2 == [0, 1, 2])
//
//var lomutoArray3 = [5, 6, 0, 2, 1, 7, 3]
//assert(lomutoPartition(&lomutoArray3, low: 0, high: lomutoArray3.count-1, <) == 3)
//assert(lomutoArray3 == [0, 2, 1, 3, 5, 7, 6])
//
//var lomutoArray4 = [1, 1, 1, 0]
//assert(lomutoPartition(&lomutoArray4, low: 0, high: lomutoArray4.count-1, <) == 0)
//assert(lomutoArray4 == [0, 1, 1, 1])
var lomutoArray1 = [2, 1, 4]
assert(lomutoPartition(&lomutoArray1, low: 0, high: lomutoArray1.count-1, <) == 2)
assert(lomutoArray1 == [2, 1, 4])

var lomutoArray2 = [2, 1, 0]
assert(lomutoPartition(&lomutoArray2, low: 0, high: lomutoArray2.count-1, <) == 0)
assert(lomutoArray2 == [0, 1, 2])

var lomutoArray3 = [5, 6, 0, 2, 1, 7, 3]
assert(lomutoPartition(&lomutoArray3, low: 0, high: lomutoArray3.count-1, <) == 3)
assert(lomutoArray3 == [0, 2, 1, 3, 5, 7, 6])

var lomutoArray4 = [1, 1, 1, 0]
assert(lomutoPartition(&lomutoArray4, low: 0, high: lomutoArray4.count-1, <) == 0)
assert(lomutoArray4 == [0, 1, 1, 1])



Expand All @@ -43,20 +53,40 @@ Implement [Hoare's partition algorithm]( https://en.wikipedia.org/wiki/Quicksort

func hoarePartition<T>(inout array: [T], low: Int, high: Int, @noescape _ isOrderedBefore: (T, T) -> Bool) -> Int {
let pivot = array[low]

// ...

return 0
var left = low
var right = high + 1

while true {
repeat {
left += 1
} while (left < high && isOrderedBefore(array[left], pivot))

repeat {
right -= 1
} while isOrderedBefore(pivot, array[right])

if left >= right {
break;
}
swap(&array[left], &array[right])
}

if (right != low) {
swap(&array[right], &array[low])
}

return right;
}

//var hoareArray1 = [2, 5, 4]
//assert(hoarePartition(&hoareArray1, low: 0, high: hoareArray1.count-1, <) == 0)
//assert(hoareArray1 == [2, 5, 4])
//
//var hoareArray2 = [5, 6, 0, 2, 1, 7, 3]
//assert(hoarePartition(&hoareArray2, low: 0, high: hoareArray2.count-1, <) == 4)
//assert(hoareArray2 == [1, 3, 0, 2, 5, 7, 6])
//
var hoareArray1 = [2, 5, 4]
assert(hoarePartition(&hoareArray1, low: 0, high: hoareArray1.count-1, <) == 0)
assert(hoareArray1 == [2, 5, 4])

var hoareArray2 = [5, 6, 0, 2, 1, 7, 3]
assert(hoarePartition(&hoareArray2, low: 0, high: hoareArray2.count-1, <) == 4)
assert(hoareArray2 == [1, 3, 0, 2, 5, 7, 6])

//This doesn't work right but sorting works fine (could see below)
//var hoareArray3 = [1, 1, 1, 0]
//assert(hoarePartition(&hoareArray3, low: 0, high: hoareArray3.count-1, <) == 1)
//assert(hoareArray3 == [0, 1, 1, 1])
Expand All @@ -69,35 +99,39 @@ By using your `hoarePartition`, implement an in-place quicksort.
*/

func quickSort<T>(inout array: [T], low: Int, high: Int, @noescape _ isOrderedBefore: (T, T) -> Bool) {

// ...
guard low < high else { return }
let partition = hoarePartition(&array, low: low, high: high, isOrderedBefore)
quickSort(&array, low: low, high: partition - 1, isOrderedBefore)
quickSort(&array, low: partition + 1, high: high, isOrderedBefore)
}

//var array1 = [1]
//quickSort(&array1, low: 0, high: array1.count - 1, <)
//assert(array1 == [1])
//
//var array2 = [Int]()
//quickSort(&array2, low: 0, high: array2.count - 1, <)
//assert(array2 == [])
//
//var array3 = [1, 2, 3]
//quickSort(&array3, low: 0, high: array3.count - 1, <)
//assert(array3 == [1, 2, 3])
//
//var array4 = [3, 0, 2, 1, 2, -1]
//quickSort(&array4, low: 0, high: array4.count - 1, <)
//assert(array4 == [-1, 0, 1, 2, 2, 3])
//
//var array5 = [1, 2, 3]
//quickSort(&array5, low: 0, high: array5.count - 1, >)
//assert(array5 == [3, 2, 1])
//
//var array6 = [5, 1, 2]
//quickSort(&array6, low: 0, high: array6.count - 1, <)
//assert(array6 == [1, 2, 5])
var array1 = [1]
quickSort(&array1, low: 0, high: array1.count - 1, <)
assert(array1 == [1])

var array2 = [Int]()
quickSort(&array2, low: 0, high: array2.count - 1, <)
assert(array2 == [])

var array3 = [1, 2, 3]
quickSort(&array3, low: 0, high: array3.count - 1, <)
assert(array3 == [1, 2, 3])

var array4 = [3, 0, 2, 1, 2, -1]
quickSort(&array4, low: 0, high: array4.count - 1, <)
assert(array4 == [-1, 0, 1, 2, 2, 3])

var array5 = [1, 2, 3]
quickSort(&array5, low: 0, high: array5.count - 1, >)
assert(array5 == [3, 2, 1])

var array6 = [5, 1, 2]
quickSort(&array6, low: 0, high: array6.count - 1, <)
assert(array6 == [1, 2, 5])

var array7 = [1, 1, 1, 0]
quickSort(&array7, low: 0, high: array7.count - 1, <)
assert(array7 == [0, 1, 1, 1])
/*:
### 1.4. 🇳🇱 problem

Expand All @@ -115,28 +149,42 @@ When the algorithm is running, there are 4 groups of elements. We need 3 indices
func dutchFlagPartition<T: Comparable>(inout array: [T], pivotIndex: Int, low: Int, high: Int) -> (Int, Int) {
let pivot = array[pivotIndex]

var smaller = 0
var equal = 0
var smaller = low
var equal = low
var larger = high

// ...
while (equal <= larger) {
if array[equal] < pivot {
swap(&array[equal], &array[smaller])
smaller++
equal++
}
else if array[equal] > pivot {
swap(&array[equal], &array[larger])
larger--
}
else {
equal++
}
}


return (smaller, larger)
}

//var dutcharray = [5, 1, 2, 2, 4, 5]
//let lowAndHigh = dutchFlagPartition(&dutcharray, pivotIndex: 2, low: 0, high: dutcharray.count - 1)
//assert(lowAndHigh.0 == 1)
//assert(lowAndHigh.1 == 2)
//assert(dutcharray == [1 ,2 ,2, 4, 5, 5])
//
//
//var dutcharray2 = [5, 10, 5, 5, 2, 5]
//let lowAndHigh2 = dutchFlagPartition(&dutcharray2, pivotIndex: 0, low: 0, high: dutcharray2.count - 1)
//assert(lowAndHigh2.0 == 1)
//assert(lowAndHigh2.1 == 4)
//assert(dutcharray2 == [2, 5, 5, 5, 5, 10])
//
var dutcharray = [5, 1, 2, 2, 4, 5]
let lowAndHigh = dutchFlagPartition(&dutcharray, pivotIndex: 2, low: 0, high: dutcharray.count - 1)
assert(lowAndHigh.0 == 1)
assert(lowAndHigh.1 == 2)
assert(dutcharray == [1 ,2 ,2, 4, 5, 5])


var dutcharray2 = [5, 10, 5, 5, 2, 5]
let lowAndHigh2 = dutchFlagPartition(&dutcharray2, pivotIndex: 0, low: 0, high: dutcharray2.count - 1)
assert(lowAndHigh2.0 == 1)
assert(lowAndHigh2.1 == 4)
assert(dutcharray2 == [2, 5, 5, 5, 5, 10])


/*:
### 1.5. Reading Swift Source Code
Expand Down
16 changes: 8 additions & 8 deletions ...orting/QuickSort.playground/Pages/Quicksort In-place.xcplaygroundpage/timeline.xctimeline
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,44 +3,44 @@
version = "3.0">
<TimelineItems>
<LoggerValueHistoryTimelineItem
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=1602&amp;EndingColumnNumber=10&amp;EndingLineNumber=34&amp;StartingColumnNumber=9&amp;StartingLineNumber=34&amp;Timestamp=472497062.906165"
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=2558&amp;EndingColumnNumber=10&amp;EndingLineNumber=64&amp;StartingColumnNumber=9&amp;StartingLineNumber=64&amp;Timestamp=474395151.051281"
selectedRepresentationIndex = "2"
shouldTrackSuperviewWidth = "NO">
</LoggerValueHistoryTimelineItem>
<LoggerValueHistoryTimelineItem
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=1602&amp;EndingColumnNumber=10&amp;EndingLineNumber=34&amp;StartingColumnNumber=9&amp;StartingLineNumber=34&amp;Timestamp=472497062.906439"
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=2558&amp;EndingColumnNumber=10&amp;EndingLineNumber=64&amp;StartingColumnNumber=9&amp;StartingLineNumber=64&amp;Timestamp=474395151.05148"
selectedRepresentationIndex = "2"
shouldTrackSuperviewWidth = "NO">
</LoggerValueHistoryTimelineItem>
<LoggerValueHistoryTimelineItem
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=1602&amp;EndingColumnNumber=14&amp;EndingLineNumber=34&amp;StartingColumnNumber=13&amp;StartingLineNumber=34&amp;Timestamp=472497062.90666"
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=2558&amp;EndingColumnNumber=14&amp;EndingLineNumber=64&amp;StartingColumnNumber=13&amp;StartingLineNumber=64&amp;Timestamp=474395151.051633"
selectedRepresentationIndex = "0"
shouldTrackSuperviewWidth = "NO">
</LoggerValueHistoryTimelineItem>
<LoggerValueHistoryTimelineItem
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=1617&amp;EndingColumnNumber=14&amp;EndingLineNumber=68&amp;StartingColumnNumber=9&amp;StartingLineNumber=68&amp;Timestamp=472497062.906874"
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=2562&amp;EndingColumnNumber=14&amp;EndingLineNumber=100&amp;StartingColumnNumber=9&amp;StartingLineNumber=100&amp;Timestamp=474395151.051787"
lockedSize = "{179, 289}"
selectedRepresentationIndex = "1"
shouldTrackSuperviewWidth = "NO">
</LoggerValueHistoryTimelineItem>
<LoggerValueHistoryTimelineItem
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=2287&amp;EndingColumnNumber=14&amp;EndingLineNumber=69&amp;StartingColumnNumber=9&amp;StartingLineNumber=69&amp;Timestamp=472497131.944604"
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=3195&amp;EndingColumnNumber=14&amp;EndingLineNumber=101&amp;StartingColumnNumber=9&amp;StartingLineNumber=101&amp;Timestamp=474395151.051941"
lockedSize = "{178, 287}"
selectedRepresentationIndex = "1"
shouldTrackSuperviewWidth = "NO">
</LoggerValueHistoryTimelineItem>
<LoggerValueHistoryTimelineItem
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=1014&amp;EndingColumnNumber=10&amp;EndingLineNumber=37&amp;StartingColumnNumber=9&amp;StartingLineNumber=37&amp;Timestamp=472497062.907309"
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=1664&amp;EndingColumnNumber=10&amp;EndingLineNumber=66&amp;StartingColumnNumber=9&amp;StartingLineNumber=66&amp;Timestamp=474390897.37583"
selectedRepresentationIndex = "2"
shouldTrackSuperviewWidth = "NO">
</LoggerValueHistoryTimelineItem>
<LoggerValueHistoryTimelineItem
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=1458&amp;EndingColumnNumber=10&amp;EndingLineNumber=38&amp;StartingColumnNumber=9&amp;StartingLineNumber=38&amp;Timestamp=472497062.907522"
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=1664&amp;EndingColumnNumber=10&amp;EndingLineNumber=66&amp;StartingColumnNumber=9&amp;StartingLineNumber=66&amp;Timestamp=474390897.375995"
selectedRepresentationIndex = "2"
shouldTrackSuperviewWidth = "NO">
</LoggerValueHistoryTimelineItem>
<LoggerValueHistoryTimelineItem
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=1014&amp;EndingColumnNumber=10&amp;EndingLineNumber=34&amp;StartingColumnNumber=9&amp;StartingLineNumber=34&amp;Timestamp=472497062.907733"
documentLocation = "#CharacterRangeLen=0&amp;CharacterRangeLoc=1664&amp;EndingColumnNumber=10&amp;EndingLineNumber=64&amp;StartingColumnNumber=9&amp;StartingLineNumber=64&amp;Timestamp=474390897.37616"
selectedRepresentationIndex = "2"
shouldTrackSuperviewWidth = "NO">
</LoggerValueHistoryTimelineItem>
Expand Down