All-Algorithms - GitLite

KO | EN

gitlite — search

#hacktoberfest #ai #android #linux #nodejs #java #windows #awesome #cli #kubernetes #vue #ios #openai #open-source

All-Algorithms

(★ 12)

No description available.

All-Algorithms 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# All-Algorithms

This repository contains examples of various algorithms written on different programming languages...

## Implemented Algorithms

| Algorithm                                                                                       | C                                     | CPP                                   | Java                                  | Python                                |
|:----------------------------------------------------------------------------------------------- |:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|
| [Euclidean GCD](https://en.wikipedia.org/wiki/Euclidean_algorithm)                              | [:octocat:](euclidean_gcd/C)          |   [:octocat:](euclidean_gcd/Cpp)                                    | [:octocat:](euclidean_gcd/Java)        | [:octocat:](euclidean_gcd/Python)     |
| [QuickSort](https://en.wikipedia.org/wiki/Quicksort)                                            |  [:octocat:](quicksort/C)                                      | [:octocat:](quicksort/Cpp)                                       |   [:octocat:](quicksort/Java)                                     | [:octocat:](quicksort/Python)         |
| [Merge Sort](https://en.wikipedia.org/wiki/Merge_sort)                                          | [:octocat:](merge_sort/C)                                       |[:octocat:](merge_sort/Cpp)                      |    [:octocat:](merge_sort/Java)                                    | [:octocat:](merge_sort/Python)        |
| [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort)                                  | [:octocat:](insertion_sort/C)         | [:octocat:](insertion_sort/Cpp)       |        [:octocat:](insertion_sort/Java)                               | [:octocat:](insertion_sort/Python)    |
| [Counting Sort](https://en.wikipedia.org/wiki/Counting_sort)                                    |    [:octocat:](counting_sort/C)  |   [:octocat:](counting_sort/Cpp)                                    |   [:octocat:](counting_sort/Java)                                     | [:octocat:](counting_sort/Python)     |
| [Radix Sort](https://en.wikipedia.org/wiki/Radix_sort)                                          | [:octocat:](radix_sort/C)        | [:octocat:](radix_sort/Cpp)   |    [:octocat:](radix_sort/Java)       | [:octocat:](radix_sort/Python)        |
| [Binary Search](https://en.wikipedia.org/wiki/Binary_search_algorithm)                          |  [:octocat:](binary_search/C)                                      | [:octocat:](binary_search/Cpp)        |   [:octocat:](binary_search/Java)                                     | [:octocat:](binary_search/Python)     |
| [Bubble Sort](https://en.wikipedia.org/wiki/Bubble_sort)                                        | [:octocat:](bubble_sort/C)            | [:octocat:](bubble_sort/Cpp)          |    [:octocat:](bubble_sort/Java)         |   [:octocat:](bubble_sort/Python)                                   |
| [Shell Sort](https://en.wikipedia.org/wiki/Shellsort)                                           | [:octocat:](shell_sort/C)             |       [:octocat:](shell_sort/Cpp)                                |            [:octocat:](shell_sort/Java)                           | [:octocat:](shell_sort/Python)        |
| [Heap Sort](https://en.wikipedia.org/wiki/Heapsort)                                             |                                       |   [:octocat:](heap_sort/Cpp)                                      |     [:octocat:](heap_sort/Java)                                    | [:octocat:](heap_sort/python)        |
| [Maximum Subarray Problem](https://en.wikipedia.org/wiki/Maximum_subarray_problem)              |                                       |                                       |                                       | [:octocat:](/maximum_subarray/Python)|
| [Coin Change Problem](https://en.wikipedia.org/wiki/Change-making_problem)              |   [:octocat:](/coin_change_problem/C)    |   [:octocat:](/coin_change_problem/Cpp)                                    |                                       | [:octocat:](/coin_change_problem/Python)|

## Implemented Data Structures

| Data Structure                                                                                  | C                                     | CPP                                   | Java                                  | Python                                | Rust                                  | JavaScript            |
|:----------------------------------------------------------------------------------------------- |:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|:-------------------------------------:|
| [Queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type))                               |[:octocat:](queue/C)                   | [:octocat:](queue/Cpp)                |[:octocat:](queue/Java)                |[:octocat:](queue/Python)              |[](queue/Rust) |[:octocat:](queue/JavaScript) |               
| [Stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))                               | [:octocat:](stack/C)                  | [:octocat:](stack/Cpp)                                      | [:octocat:](stack/Java)               | [:octocat:](stack/Python)             | [](stack/Rust) |[](queue/JavaScript) |       
| [Linear Linked List](https://en.wikipedia.org/wiki/Linked_list)                                 | [:octocat:](linked_list/C)            | [:octocat:](linked_list/CPP)                                                                                           | [:octocat:](linked_list/Java)                                      | [:octocat:](linked_list/Python)       | [](linked_list/Rust) |[](queue/JavaScript) |       
| [AVL Tree](https://en.wikipedia.org/wiki/AVL_tree)                                              | [:octocat:](avl_tree/C)               | [:octocat:](avl_tree/CPP)             | [:octocat:](avl_tree/Java)            | [:octocat:](avl_tree/Python)          |[](avl_tree/Rust) |[](queue/JavaScript) |                 
| [Binary Tree](https://www.geeksforgeeks.org/binary-tree-data-structure/)                                              | [](binary_tree/C)               | [](binary_tree/CPP)             | [](binary_tree/Java)            | [](binary_tree/Python)          |[:octocat:](binary_tree/Rust)          |[](queue/JavaScript) |

## Sample Run

| Language        | Steps                                                                  |
| --------------- | ---------------------------------------------------------------------- |
| JavaScript      | <pre>node [filename.js]</pre>                                          |
| Python          | <pre>python [filename.py]</pre>                                        |
| C               | <pre>gcc [filename.c]<br>./a.out  # unix<br>a.exe  # windows</pre>     |
| CPP             | <pre>g++ [filename.cpp]<br>./a.out # unix<br>a.exe # windows</pre>     |
| Java            | <pre>javac [filename.java]<br>java [filename]</pre>                    |

## Contributing

1. Fork it!
2. Clone the forked repository to local system.
3. Create your feature branch: `git checkout -b my-new-feature`
4. Commit your changes: `git commit -am 'Add some feature'`.
5. Push to the branch: `git push origin my-new-feature`
6. Submit a pull request :smile: