Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings
This repository was archived by the owner on Jul 24, 2023. It is now read-only.

Commit eb32c49

Browse files
author
cd155
committed
reformat readme
1 parent 407ec49 commit eb32c49

File tree

1 file changed

+24
-37
lines changed

1 file changed

+24
-37
lines changed

‎README.md

Lines changed: 24 additions & 37 deletions
Original file line numberDiff line numberDiff line change
@@ -2,30 +2,22 @@
22
Haskell Practice for solving real code problems, including Sorting, Searching, Tree, Graph, Recursion, Dynamic Programming and more.
33

44
## Sorting
5-
- Bubble Sort
6-
https://github.com/cd155/algorithm-design-with-haskell/blob/0b28d915860446f07bb6643388dc9894cc75fcd7/src/Sorting.hs#L6-L22
7-
- Radix sort
8-
https://github.com/cd155/algorithm-design-with-haskell/blob/0b28d915860446f07bb6643388dc9894cc75fcd7/src/Sorting.hs#L24-L72
9-
- Quick Sort
10-
https://github.com/cd155/algorithm-design-with-haskell/blob/0b28d915860446f07bb6643388dc9894cc75fcd7/src/Sorting.hs#L99-L120
11-
- Merge Sort
12-
https://github.com/cd155/algorithm-design-with-haskell/blob/0b28d915860446f07bb6643388dc9894cc75fcd7/src/Sorting.hs#L74-L97
5+
- [Bubble Sort](https://github.com/cd155/algorithm-design-with-haskell/blob/0b28d915860446f07bb6643388dc9894cc75fcd7/src/Sorting.hs#L6-L22)
6+
- [Radix Sort](https://github.com/cd155/algorithm-design-with-haskell/blob/0b28d915860446f07bb6643388dc9894cc75fcd7/src/Sorting.hs#L24-L72)
7+
- [Quick Sort](https://github.com/cd155/algorithm-design-with-haskell/blob/0b28d915860446f07bb6643388dc9894cc75fcd7/src/Sorting.hs#L99-L120)
8+
- [Merge Sort](https://github.com/cd155/algorithm-design-with-haskell/blob/0b28d915860446f07bb6643388dc9894cc75fcd7/src/Sorting.hs#L74-L97)
139

1410
- Interview Questions - Sorting
1511
- [10.1 - Sort two sorted arrays into one sorted array](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Sorting.hs#L122)
1612
- [10.2 - Write a method to group all the anagrams (eg: "ate","eat","tea")](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Sorting.hs#L139)
1713
- [10.11 - Sort the array into an alternating sequence of Peaks and Valleys](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Sorting.hs#L163)
1814

1915
- Heap
20-
- what this heap
21-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L79-L91
22-
- view the Heap as an array
23-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L99-L110
24-
- build a max heap
25-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L112-L119
16+
- [what this heap](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L79-L91)
17+
- [view the Heap as an array](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L99-L110)
18+
- [build a max heap](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L112-L119)
2619

27-
- Heap Sort
28-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L155-L169
20+
- [Heap Sort](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L155-L169)
2921

3022
## Searching
3123
- linear search
@@ -40,34 +32,29 @@ https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215
4032
- 10.8
4133
- [10.9 - Find the element in a sorted matrix](https://github.com/cd155/algorithm-design-with-haskell/blob/72b0ae8680e18aba8021443534dbfe6d460a4419/src/BinarySearch.hs#L249)
4234
## Tree
43-
- Academic Term Definition of Tree
44-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L7-L11
45-
- Definition - Tree
46-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L23-L42
35+
- [Academic Term Definition of Tree](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L7-L11)
36+
- Definition - [Tree](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L23-L42)
4737
- Traverse in BiTree
48-
- in-order traverse
49-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L44-L51
50-
- pre-order traverse
51-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L53-L60
52-
- post-order traverse
53-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L62-L69
54-
- Depth-first and Breadth-first search
55-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L171-L180
56-
- Depth-first search
57-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L182-L196
58-
- Breadth-first search
59-
https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L198-L203
60-
- Interview Questions - Tree
38+
- [in-order traverse](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L44-L51)
39+
- [pre-order traverse](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L53-L60)
40+
- [post-order traverse](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L62-L69)
41+
- [Depth-first and Breadth-first search explain](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L171-L180)
42+
- [Depth-first search](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L182-L196)
43+
- [Breadth-first search](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Tree.hs#L198-L203)
44+
- [Interview Questions]()
6145
- 4.2, 4.4, 4.5, 4.6, 4.8, 4.9, 4.12
6246

6347
## Graph
64-
- Definition - Graph
65-
- Interview Questions - Graph
48+
- Definition
49+
- [Interview Questions](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Graph.hs)
50+
- 4.1, 4.7
6651

6752
## LinkedList
6853
- Definition
69-
- Interview Questions - LinkedList
54+
- [Interview Questions](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/LinkedList.hs)
55+
- 2.1, 4.3
7056

7157
## Recursion and Dynamic Programming
7258
- Definition
73-
- Interview Questions
59+
- [Interview Questions](https://github.com/cd155/algorithm-design-with-haskell/blob/71661bb4fa30663da215351bfaf55cd768952af7/src/Recursion.hs)
60+
- 8.1, 8.2, 8.3, 8.4, 8.6, 8.7, 8.8, 8.9, 8.10

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /