Description: Introduction to sorting algorithms. In this session, we define the common ways to sort an array or a List into ascending or descending order. We will cover bubble, selection, insertion, merge, and quicksort.
ACM CCECC
N/A
AP CS A
N/A
CS2
N/A
Description: The first sorting algorithm we will be reviewing will be bubble sort. In this video, students will know the characteristics of the sort, how it works by showcasing its principles by animation, and how to implement the algorithm.
ACM CCECC
N/A
AP CS A
N/A
CS2
N/A
Description: The second sorting algorithm we will be reviewing will be selection sort. In this video, students will know the characteristics of the sort, how it works by showcasing its principles by animation, and how to implement the algorithm.
ACM CCECC
N/A
AP CS A
[The Selection and Insertion Sort]
CON-2.L Apply selection sort and insertion sort algorithms to sort the elements of an array or ArrayList objects.
CON-2.L.1 Selection sort and insertion sort are iterative sorting algorithms that can be used to sort elements in an array or ArrayList.
CS2
N/A
Description: The third sorting algorithm we will be reviewing will be insertion sort. In this video, students will know the characteristics of the sort, how it works by showcasing its principles by animation, and how to implement the algorithm.
ACM CCECC
N/A
AP CS A
[The Selection and Insertion Sort]
CON-2.L Apply selection sort and insertion sort algorithms to sort the elements of an array or ArrayList objects.
CON-2.L.1 Selection sort and insertion sort are iterative sorting algorithms that can be used to sort elements in an array or ArrayList.
CS2
N/A
Description: The fourth sorting algorithm we will be reviewing will be merge sort. In this video, students will know the characteristics of the sort, how it works by showcasing its principles by animation, and how to implement the algorithm.
ACM CCECC
[Sorting Algorithms]
AL-09. Implement common sorting algorithms, including iterative, quadratic, and recursive.
AP CS A
[The Merge Sort and Quicksort]
CON-2.Q Apply recursive algorithms to sort elements of an array or ArrayList objects.
CON-2.Q.1 Merge sort is a recursive sorting algorithm that can be used to sort elements in an array or ArrayList.
CS2
N/A
Description: The fifth and last sorting algorithm we will be reviewing will be quick sort. In this video, students will know the characteristics of the sort, how it works by showcasing its principles by animation, and how to implement the algorithm.
ACM CCECC
[Sorting Algorithms]
AL-09. Implement common sorting algorithms, including iterative, quadratic, and recursive.
AP CS A
[The Merge Sort and Quicksort]
CON-2.Q Apply recursive algorithms to sort elements of an array or ArrayList objects.
CON-2.Q.1 Merge sort is a recursive sorting algorithm that can be used to sort elements in an array or ArrayList.
CS2
N/A
Description: In this part of the session, we start discussing how we analyze the effectiveness of algorithms. Big-Oh Notation is a mathematical way of describing how a function generally behaves in relation to the input size.
ACM CCECC
[Sorting Algorithms]
SDF-03. Compare multiple algorithms for a given problem.
AP CS A
[Complexity Analysis]
CON-2.M Compute statement execution counts and informal run-time comparison of sorting algorithms.
CON-2.M.1 Informal run-time comparisons of program code segments can be made using statement execution counts.
CS2
[Sorting Algorithms]
130.422.c.4.h Identify, describe, design, create, evaluate, and compare standard sorting algorithms, including selection sort, bubble sort, insertion sort, and merge sort;
[Complexity Analysis]
130.422.c.4.k Analyze algorithms using "big-O" notation for best, average, and worst-case data patterns;
130.422.c.4.o Compare and contrast algorithm efficiency by using informal runtime comparisons, exact calculation of statement execution counts, and theoretical efficiency values using "big-O" notation, including worst-case, best-case, and average-case time/space analysis;
130.422.c.4.i Measure the time/space efficiency of various sorting algorithms;