Arrays and Sorting Algorithms - Intro to Computer Science - Harvard's CS50 (2018)

Overview

This course covers the learning outcomes and goals of understanding arrays, strings, and sorting algorithms in the C programming language. The individual skills taught include preprocessing, compiling, assembling, linking, debugging tools, working with RAM, and implementing sorting algorithms such as Bubble Sort, Selection Sort, and Merge Sort. The teaching method involves a lecture format with practical examples and code demonstrations. The intended audience for this course is beginners in computer science or programming enthusiasts looking to strengthen their foundational knowledge in algorithms and data structures.

Syllabus

) Introduction.
) Week 1 Recap.
) Preprocessing.
) Compiling.
) Assembling.
) Linking.
) buggy0.c.
) buggy2.c.
) Debugging Tools.
) RAM.
) Arrays.
) scores0.c.
) scores2.c.
) scores4.c.
) string0.c.
) Null Terminator.
) strlen.c.
) ascii0.c.
) capitalize0.c.
) capitalize1.c.
) argv0.c.
) argv1.c.
) Ciphering.
) exit.c.
) Finding 50.
) Sorting on Stage.
) Bubble Sort.
) Selection Sort.
) Computational Complexity.
) Merge Sort.
) Comparing Sorts Visually.