Skip to content

Commit 25b643a

Browse files
xlogixxlogix
committed
Cleanup
1 parent 7e1f40c commit 25b643a

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

46 files changed

+32
-1147
lines changed

‎.DS_Store‎

2 KB
Binary file not shown.

‎N-queen_backtracking.cpp‎

Lines changed: 0 additions & 68 deletions
This file was deleted.

‎Quick sort/QuickSort.java‎

Lines changed: 0 additions & 56 deletions
This file was deleted.

‎Quick sort/QuickSort.py‎

Lines changed: 0 additions & 28 deletions
This file was deleted.

‎Quick sort/quicksort.cpp‎

Lines changed: 0 additions & 72 deletions
This file was deleted.

‎README.md‎

Lines changed: 32 additions & 41 deletions
Original file line numberDiff line numberDiff line change
@@ -15,61 +15,51 @@ This repository contains examples of various algorithms written on different pro
1515

1616
## Implemented Algorithms
1717

18-
| Algorithm | C | CPP | Java | Python |
19-
|:----------------------------------------------------------------------------------------------- |:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|
20-
| [Euclidean GCD](https://en.wikipedia.org/wiki/Euclidean_algorithm) | [:octocat:](euclidean_gcd/C) | [:octocat:](euclidean_gcd/C) | [:octocat:](euclidean_gcd/Java) | [:octocat:](euclidean_gcd/Python) |
21-
| [QuickSort](https://en.wikipedia.org/wiki/Quicksort) | | | | [:octocat:](quicksort/Python) |
22-
| [Merge Sort](https://en.wikipedia.org/wiki/Merge_sort) | | | | [:octocat:](merge_sort/Python) |
23-
| [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort) | [:octocat:](insertion_sort/C) | [:octocat:](insertion_sort/Cpp) | | [:octocat:](insertion_sort/Python) |
24-
| [Counting Sort](https://en.wikipedia.org/wiki/Counting_sort) | | | | [:octocat:](counting_sort/Python) |
25-
| [Radix Sort](https://en.wikipedia.org/wiki/Radix_sort) | | | | [:octocat:](radix_sort/Python) |
26-
| [Binary Search](https://en.wikipedia.org/wiki/Binary_search_algorithm) | | [:octocat:](binary_search/Cpp) | | [:octocat:](binary_search/Python) |
27-
| [Bubble Sort](https://en.wikipedia.org/wiki/Bubble_sort) | [:octocat:](bubble_sort/C) | [:octocat:](bubble_sort/Cpp) | | |
28-
| [fibonacci series](https://en.wikipedia.org/wiki/Fibonacci_number) | [:octocat:](shell_sort/C) | | | [:octocat:](shell_sort/Python) |
29-
| [Heap Sort](https://en.wikipedia.org/wiki/Heapsort) | | | | [:octocat:](heap_sort/python) |
30-
31-
18+
| Algorithm | C | CPP | Java | Python | JavaScript |
19+
|:------------------------------------------------------------------ |:-----------------------------:|:-------------------------------:|:-------------------------------:|:----------------------------------:| ---------- |
20+
| [Euclidean GCD](https://en.wikipedia.org/wiki/Euclidean_algorithm) | [:octocat:](euclidean_gcd/C) | [:octocat:](euclidean_gcd/C) | [:octocat:](euclidean_gcd/Java) | [:octocat:](euclidean_gcd/Python) | |
21+
| [QuickSort](https://en.wikipedia.org/wiki/Quicksort) | | | | [:octocat:](quicksort/Python) | |
22+
| [Merge Sort](https://en.wikipedia.org/wiki/Merge_sort) | | | | [:octocat:](merge_sort/Python) | |
23+
| [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort) | [:octocat:](insertion_sort/C) | [:octocat:](insertion_sort/Cpp) | | [:octocat:](insertion_sort/Python) | |
24+
| [Counting Sort](https://en.wikipedia.org/wiki/Counting_sort) | | | | [:octocat:](counting_sort/Python) | |
3225

3326
## Implemented Data Structures
3427

35-
| Data Structure | C | CPP | Java | Python |
36-
|:----------------------------------------------------------------------------------------------- |:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|
37-
| [Queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)) | | [:octocat:](queue/Cpp) | | |
38-
| [Stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type)) | | | [:octocat:](stack/Java) | [:octocat:](stack/Python) |
39-
40-
28+
| Data Structure | C | CPP | Java | Python | JavaScript |
29+
|:---------------------------------------------------------------- |:---:|:----------------------:|:-----------------------:|:-------------------------:| ---------- |
30+
| [Queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type) | | [:octocat:](queue/Cpp) | | | |
31+
| [Stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type) | | | [:octocat:](stack/Java) | [:octocat:](stack/Python) | |
4132

4233
## Sample Run
4334

44-
| Language | Steps |
45-
| --------------- | ---------------------------------------------------------------------- |
46-
| Python | <pre>python [filename.py]</pre> |
47-
| C | <pre>gcc [filename.c]<br>./a.out # unix<br>a.exe # windows</pre> |
48-
| CPP | <pre>g++ [filename.cpp]<br>./a.out # unix<br>a.exe # windows</pre> |
49-
| Java | <pre>javac [filename.java]<br>java [filename]</pre> |
50-
| golang | <pre>go build [filename.go]<br>[./filename]</pre> |
35+
| Language | Steps |
36+
| -------- | ------------------------------------------------------------------ |
37+
| Python | <pre>python [filename.py]</pre> |
38+
| C | <pre>gcc [filename.c]<br>./a.out # unix<br>a.exe # windows</pre> |
39+
| CPP | <pre>g++ [filename.cpp]<br>./a.out # unix<br>a.exe # windows</pre> |
40+
| Java | <pre>javac [filename.java]<br>java [filename]</pre> |
41+
| golang | <pre>go build [filename.go]<br>[./filename]</pre> |
5142

5243
## Trees
5344

54-
| Alogrithm | C | C++ | Java | Python | JavaScript|
55-
| --------------- | -----|------|------|---------------|-------------- |
56-
| Pre-Order Traversal | | | | | |
57-
| Post-Order Traversal | | | | | |
58-
| In-Order Traversal | | | | | |
59-
| Binary Search Tree | | | | | |
60-
| Height of the Tree | | | | | |
61-
| Depth of the Tree | | | | | |
62-
| AVL Tree | | | | | |
63-
| Spanning Tree | | | | | |
64-
45+
| Alogrithm | C | CPP | Java | Python | JavaScript |
46+
|:-------------------- | --- | --- | ---- | ------ |:----------:|
47+
| Pre-Order Traversal | | | | | |
48+
| Post-Order Traversal | | | | | |
49+
| In-Order Traversal | | | | | |
50+
| Binary Search Tree | | | | | |
51+
| Height of the Tree | | | | | |
52+
| Depth of the Tree | | | | | |
53+
| AVL Tree | | | | | |
54+
| Spanning Tree | | | | | |
6555

6656
## Contributing
6757

6858
1. Fork it!
6959
2. Clone the forked repository to local system.
7060
3. Create your feature branch: `git checkout -b my-new-feature`
7161
4. Commit your changes: `git commit -am 'Add some feature'`.
72-
62+
7363
Go through [Commit Messages guidelines](CONTRIBUTING.md#write-good-commit-messages)
7464
5. Push to the branch: `git push origin my-new-feature`
7565
6. Submit a pull request :smile:
@@ -78,12 +68,13 @@ See [Contributor.md](Contributor.md).
7868

7969
## Support
8070

81-
Feel free to contact us at our [E-mail]([email protected]), we'd be happy to help!
71+
Feel free to contact us at our [E-mail](mailto:[email protected]), we'd be happy to help!
8272

8373
## Notes
8474

8575
Only project maintainers should merge a PR.
8676
Other members can add their reviews to a PR but the merging should be done by only a project maintainer.
8777

8878
## Authors
89-
* [Saurav Jaiswal](https://github.com/sauravjaiswalsj)
79+
80+
* [Saurav Jaiswal](https://github.com/sauravjaiswalsj)

‎Stack.java‎

Lines changed: 0 additions & 55 deletions
This file was deleted.

0 commit comments

Comments
 (0)