Search results
CS50's Introduction to Computer Science is an exceptional online course that delivers a comprehensive and engaging experience for anyone interested in exploring the vast realm of computer science. Developed by the renowned Harvard University, this course serves as a perfect starting point for beginners and a valuable resource for those seeking ...
- (174)
Learn AP Computer Science Principles using videos, articles, and AP-aligned multiple choice question practice. Review the fundamentals of digital data representation, computer components, internet protocols, programming skills, algorithms, and data analysis.
An entry-level course taught by David J. Malan, CS50x teaches students how to think algorithmically and solve problems efficiently. Topics include abstraction, algorithms, data structures, encapsulation, resource management, security, software engineering, and web development.
- Overview
- About this unit
- Intro to algorithms
- Binary search
- Asymptotic notation
- Selection sort
- Insertion sort
- Recursive algorithms
- Towers of Hanoi
- Merge sort
About this unit
We've partnered with Dartmouth college professors Tom Cormen and Devin Balkcom to teach introductory computer science algorithms, including searching, sorting, recursion, and graph theory. Learn with a combination of articles, visualizations, quizzes, and coding challenges.
Intro to algorithms
What are algorithms and why should you care? We'll start with an overview of algorithms and then discuss two games that you could use an algorithm to solve more efficiently - the number guessing game and a route-finding game.
We've partnered with Dartmouth college professors Tom Cormen and Devin Balkcom to teach introductory computer science algorithms, including searching, sorting, recursion, and graph theory. Learn with a combination of articles, visualizations, quizzes, and coding challenges.
What are algorithms and why should you care? We'll start with an overview of algorithms and then discuss two games that you could use an algorithm to solve more efficiently - the number guessing game and a route-finding game.
Learn about binary search, a way to efficiently search an array of items by halving the search space each time.
Learn how to use asymptotic analysis to describe the efficiency of an algorithm, and how to use asymptotic notation (Big O, Big-Theta, and Big-Omega) to more precisely describe the efficiency.
Learn selection sort, a simple algorithm for sorting an array of values, and see why it isn't the most efficient algorithm.
Learn insertion sort, another simple but not very efficient way to sort an array of values.
Learn the concept of recursion, a technique that is often used in algorithms. See how to use recursion to calculate factorial and powers of a number, plus to generate art.
Use the recursive technique to solve the Towers of Hanoi, a classic mathematical puzzle and one reportedly faced by monks in a temple.
Learn merge sort, a more efficient sorting algorithm that relies heavily on the power of recursion to repeatedly sort and merge sub-arrays.
A broad and robust understanding of computer science and programming. How to think algorithmically and solve programming problems efficiently. Concepts like abstraction, algorithms, data structures, encapsulation, resource management, security, software engineering, and web development.
This course will introduce you to the field of computer science and the fundamentals of computer programming. CS101 is specifically designed for students with no prior programming experience and touches upon a variety of fundamental topics. This course uses Java to demonstrate those topics.
Mar 22, 2024 · Learn what it takes to earn a bachelor's degree in computer science, including the coursework, and what you can do after earning the degree. A bachelor’s degree in computer science—also called a CS degree—is an undergraduate program that typically involves learning about the fundamentals of computer systems and operations before focusing ...
