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

Overview

Dive into the fundamentals of computer science with this comprehensive lecture from Harvard University's CS50 2018 course. Explore arrays, strings, and sorting algorithms in the C programming language. Begin with a recap of the previous week's content before delving into the intricacies of the compilation process, including preprocessing, compiling, assembling, and linking. Learn debugging techniques and gain insights into computer memory. Discover how to work with arrays and strings, manipulate text, and implement command-line arguments. Investigate ciphering techniques and various sorting algorithms, including bubble sort, selection sort, and merge sort. Analyze the computational complexity of different sorting methods and compare their performance visually. Access accompanying notes, problem sets, and source code to enhance your learning experience.

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.