The badge earner is able to design and analyze fundamental algorithms and is able to explain and describe key algorithmic concepts and principles including the following: Sorting Algorithms (selection sort, bubble sort, insertion sort), Time and Space Complexity Analysis (big-oh, omega and theta notations), Recursive Algorithms and Master Theorem, Divide and Conquer Algorithms (merge sort, quick sort and matrix multiplication), Trees (binary search trees, AVL trees, red-black trees).

• Type Validation
• Level Foundational
• Time Weeks
• Cost Paid