AP Computer Science A || Runtime and Efficient Sorts (Video 7)

Video 7 of AP Computer Science A covers quicksort and merge sort, two efficient sorting algorithms, how to make programs faster, and determining the runtime of a program. 0:00 Intro 0:04 Quicksort 0:57 Quicksort Implementation 4:10 Merge Sort 5:34 How to Sort with Library Functions 6:18 Optional Exercise 6:44 Solution to Optional Exercise 8:26 Making a Program Faster 11:05 Runtime 19:31 Outro List of All Videos of AP Computer Science A: https://www.scapenext.org/programs-3 Video 8: https://youtu.be/YBy8l64p6Io Music: Elektronomia - Fire https://www.youtube.com/watch?v=mX-SktWVHao