Add sorting algorithms content

content/roadmaps/103-computer-science/content/104-common-algorithms/100-sorting-algorithms/100-bubble-sort.md

@@ -1 +1,8 @@
-# Bubble sort
+# Bubble Sort
+
+Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted.
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB'>Bubble Sort</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB'>Analyzing Bubble Sort</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://youtu.be/xli_FI7CuzA'>Bubble sort in 2 minutes</BadgeLink>

content/roadmaps/103-computer-science/content/104-common-algorithms/100-sorting-algorithms/101-selection-sort.md

@@ -1 +1,7 @@
-# Selection sort
+# Selection Sort
+
+Selection sort is a sorting algorithm that selects the smallest unsorted item in the list and swaps it with index 0, then finds the next smallest and places it into index 1 and so on.
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.youtube.com/watch?v=g-PGLbMth_g'>Selection Sort in 3 Minutes</BadgeLink>
+<BadgeLink colorScheme='red' badgeText='Watch' href='https://www.coursera.org/lecture/algorithms-part1/selection-UQxFT'>Selection Sort</BadgeLink>

content/roadmaps/103-computer-science/content/104-common-algorithms/100-sorting-algorithms/readme.md

@@ -1 +1,11 @@
-# Sorting algorithms
+# Sorting Algorithms
+
+Sorting algorithms are used to sort data in a collection. Sorting is a very common task in computer science, and it is also a very common interview question. There are many different ways to sort data, and different algorithms have different advantages and disadvantages.
+
+Learn about the sorting algorithms and know the best case/worst case, average complexity of each. Also, learn about the stability of sorting algorithms.
+
+<ResourceGroupTitle>Free Content</ResourceGroupTitle>
+<BadgeLink colorScheme='blue' badgeText='Watch' href='https://archive.org/details/ucberkeley_webcast_EiUvYS2DT6I'>CS 61B Lecture 29: Sorting I</BadgeLink>
+<BadgeLink colorScheme='blue' badgeText='Watch' href='https://archive.org/details/ucberkeley_webcast_2hTY3t80Qsk'>CS 61B Lecture 30: Sorting II</BadgeLink>
+<BadgeLink colorScheme='blue' badgeText='Watch' href='https://archive.org/details/ucberkeley_webcast_Y6LOLpxg6Dc'>CS 61B Lecture 32: Sorting III</BadgeLink>
+<BadgeLink colorScheme='blue' badgeText='Watch' href='https://archive.org/details/ucberkeley_webcast_qNMQ4ly43p4'>CS 61B Lecture 33: Sorting V</BadgeLink>

content/roadmaps/103-computer-science/content/104-common-algorithms/readme.md

@@ -1 +1,15 @@
-# Common algorithms
+# Common Algorithms
+
+Here are some common algorithms that you should know. You can find more information about them in the [Algorithms](https://www.khanacademy.org/computing/computer-science/algorithms) section of the Computer Science course.
+
+* Sorting
+* Recursion
+* Searching
+* Cache Algorithms
+* Tree Algorithms
+* Graph Algorithms
+* Greedy Algorithms
+* Backtracking
+* Substring Search
+* Suffix Arrays
+* Dynamic Programming