AP COMPUTER SCIENCE A
Array vs ArrayList Memory Resizing
Witness the internal array backing an ArrayList dynamically resize. Compare fixed memory bounds against O(N) copy operations when capacity is exceeded.
AP COMPUTER SCIENCE A
Heapsort Visualization
Visualize treating a flat array as a Complete Binary Tree. Watch the algorithm Build Max Heap, then extract elements to sort in O(N log N) time without extra memory.
AP COMPUTER SCIENCE A
Sorting Algorithms O(N^2) vs O(N log N)
Visualize Selection, Insertion, and Merge sort line-by-line. Track memory accesses, array swaps, and Big-O efficiency in real time.