You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This repository is part of a series of posts about data structures reimplemented in JavaScript that I made [on my blog](http://blog.benoitvallon.com).
3
+
This repository contains code about various series of posts that I made [on my blog](http://blog.benoitvallon.com) about computer science (mostly data structures and sorting algorithms) reimplemented in JavaScript.
4
4
5
-
# About the #data-structures series
5
+
## What's in this repository?
6
+
7
+
As of now, it contains 2 main sections:
8
+
9
+
- Data structures in JavaScript
10
+
- Sorting algorithms in JavaScript
11
+
12
+
## The #data-structures series
6
13
7
14
The [#data-structures series](http://blog.benoitvallon.com/category/data-structures-in-javascript) is a collection of posts about reimplemented data structures in JavaScript.
8
15
9
16
If you are not familiar with data structures, a quick introduction and the full list of reimplemented data structures can be found in the [introduction post of the series on data structures in JavaScript](http://blog.benoitvallon.com/data-structures-in-javascript/data-structures-in-javascript).
10
17
11
18
If you feel comfortable with the concept of each data structure and only want to see the code, have a look at the summary post of the series. It removes all explanations and contains only the [JavaScript code for all data structures](http://blog.benoitvallon.com/data-structures-in-javascript/data-structures-in-javascript-all-the-code) discussed in the series.
12
19
13
-
Of course, all the code can also be found on Github in the repository [data-structures-in-javascript](https://github.com/benoitvallon/data-structures-in-javascript).
14
-
15
-
# The data structures in the series
20
+
### The data structures in the series
16
21
17
22
-[x] Array
18
23
-[x] Hash Table
@@ -25,3 +30,32 @@ Of course, all the code can also be found on Github in the repository [data-stru
25
30
-[x] Binary Search Tree
26
31
-[x] Trie
27
32
-[x] Graph
33
+
34
+
## The #sorting-algorithms series
35
+
36
+
The [#sorting-algorithms series](http://blog.benoitvallon.com/category/sorting-algorithms-in-javascript) is a collection of posts about reimplemented sorting algorithms in JavaScript.
37
+
38
+
If you are not familiar with sorting algorithms, a quick introduction and the full list of reimplemented sorting algorithms can be found in the [introduction post of the series on sorting algorithms in JavaScript](http://blog.benoitvallon.com/sorting-algorithms-in-javascript/sorting-algorithms-in-javascript).
39
+
40
+
If you feel comfortable with the concept of each sorting algorithms and only want to see the code, have a look at the summary post of the series. It removes all explanations and contains only the [JavaScript code for all sorting algorithms](http://blog.benoitvallon.com/sorting-algorithms-in-javascript/sorting-algorithms-in-javascript-all-the-code) discussed in the series.
41
+
42
+
### The sorting algorithms in the series
43
+
44
+
-[x] Bubble sort
45
+
-[x] Selection sort
46
+
-[x] Insertion sort
47
+
-[x] Shellsort
48
+
-[x] Merge sort
49
+
-[x] Quicksort
50
+
51
+
### A good way to compare all of them
52
+
53
+
Unlike the [data structures](http://blog.benoitvallon.com/data-structures-in-javascript/data-structures-in-javascript/), all [sorting algorithms](http://blog.benoitvallon.com/sorting-algorithms-in-javascript/sorting-algorithms-in-javascript) have the same goal and they can all take the same input data. So, for every sorting algorithms of the series, we are going sort an `array` of 10 numbers from 1 to 10.
54
+
55
+
By doing so we will be able to compare the different sorting algorithms more easily. Sorting algorithms are very sensitive to the input data so we will also try different input data to see how they affect the performances.
56
+
57
+
## Why this repository?
58
+
59
+
At the beginning I started those series with 2 different repositories, one for the data structures and another one for the sorting algorithms. It was nice to keep things separately at first but grouping them into the same repository makes more sense to me now.
60
+
61
+
All computer science concepts are located at the same place and it will allow me to add even more things in the future. Moreover, it won’t be mandatory that those things will be about data structures or sorting algorithms. There are other important things to know too.
0 commit comments