Sorting and Searching alGOrithms
•
1 like•71 views
A presentation explaining Quicksort and Binary Search in Go with Testing and Benchmarks
Recommended
Recommended
More Related Content
Recently uploaded
Recently uploaded (20)
Featured
Featured (20)
Sorting and Searching alGOrithms
- 1. Sorting & Searching alGOrithms Kaylyn Gibilterra Gotham Go 2018 Capital One Labs @kgibilterra
- 4. 1. Sorting Algorithms - Quicksort 2. Searching Algorithms - Binary Search
- 5. 1. New to Go Who is this talk for?
- 6. 1. New to Go 2. New to algorithms Who is this talk for?
- 7. 1. New to Go 2. New to algorithms 3. I already know these, why am I here Who is this talk for?
- 10. Quicksort “Given an array, one element is chosen and the others are partitioned into two subsets-those less than the partition element and those greater than or equal to it. The same process is then applied recursively to the two subsets. When a subset has fewer than two elements, it doesn't need any sorting; this stops the recursion.” Kernighan and Ritchie
- 12. EA DCB FG
- 13. EA DCB FG pivot
- 14. DC EGB FA
- 15. EA DCB FG pivot
- 16. EA DCB FG pivot B < D
- 17. EA DCB FG pivot split B < D
- 18. EA DCB FG pivot split B < D
- 19. EA DCB FG pivot split G > D
- 20. EA DCB FG pivot split A < D
- 21. EA DCB FG pivot split swap A < D
- 22. EG DCB FA pivot swap split A < D
- 23. EG DCB FA pivot split A < D
- 24. EG DCB FA pivot split E > D
- 25. EG DCB FA pivot split F > D
- 26. EG DCB FA pivot split C < D
- 27. EG DCB FA pivot split swap C < D
- 28. EC DGB FA pivot swap split C < D
- 29. EC DGB FA pivot split C < D
- 34. DC EGB FA left array right array
- 35. CB A pivot
- 36. CB A pivot split
- 37. CB A pivot split
- 38. CB A pivot split
- 39. CB A pivot split
- 40. CB A pivot split
- 41. CB A final split
- 42. CB A left array
- 43. B A
- 44. B A pivot
- 45. B A pivot split
- 46. B A pivot split
- 48. A B split swap
- 49. A B split final
- 50. A B right array
- 51. A B final
- 52. DC EGA FB left array right array
- 53. EGF pivot
- 54. EGF pivot split
- 55. EGF pivot split
- 56. EGF pivot split
- 58. FGE split swap
- 60. FG pivot
- 61. FG pivot split
- 62. FG pivot split
- 64. GF split swap
- 66. GF final
- 67. DC GFA EB
- 70. Quicksort Test
- 71. Quicksort Test
- 72. Quicksort Test
- 74. Quicksort Benchmark go test -bench=.
- 78. Binary Search Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty. GeeksForGeeks
- 79. DC GFA EB
- 80. DC GFA EB
- 81. DC GFA EB
- 82. DC GFA EB lo hi
- 83. DC GFA EB lo himid
- 84. DC GFA EB lo himid E > D
- 85. DC GFA EB lo himid E > D left array right array
- 86. D GFE himid E > D right array lo
- 87. GFE hilo
- 88. GFE hi E < F lo mid
- 89. GFE hi E < F lo mid right arrayleft array
- 90. FE E < F lo mid left array hi
- 91. E E = E lo hi
- 93. E E = E
- 94. What would happen if we were looking for an element in-between E and F?
- 95. E hi lo F
- 96. E hi lo D
- 100. Binary Search Stress Test
- 101. Binary Search Stress Test
- 102. Binary Search Stress Test
- 103. Binary Search Stress Test
- 104. Binary Search Stress Test
- 105. Binary Search Stress Test
- 106. alGOrithms are great