lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update 05_quicksort.kt (#267)

Browse Source 
remove unnecessary line
This commit is contained in:
Adnan
2023-08-09 02:41:22 +03:30
committed by GitHub
parent 8969269a10
commit 9306432a1b
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
04_quicksort/kotlin/05_quicksort.kt
View File

@@ -3,10 +3,9 @@ fun quickSort(list: List<Int>): List<Int> {
if (list.size <= 1) return list if (list.size <= 1) return list
// recursive case // recursive case
val pivot = list[list.size / 2] val pivot = list[list.size / 2]
val equal = list.filter { it == pivot }
val less = list.filter { it < pivot } val less = list.filter { it < pivot }
val greater = list.filter { it > pivot } val greater = list.filter { it > pivot }
return quickSort(less) + equal + quickSort(greater) return quickSort(less) + pivot + quickSort(greater)
} }
fun main(args: Array<String>) = println(quickSort(listOf(10, 5, 2, 3))) // [2, 3, 5, 10] fun main(args: Array<String>) = println(quickSort(listOf(10, 5, 2, 3))) // [2, 3, 5, 10]