TheAlgorithms-C/DIRECTORY.md

503 lines
38 KiB
Markdown
Raw Normal View History

2020-01-09 11:29:42 +03:00
## Audio
* [Alaw](https://github.com/TheAlgorithms/C/blob/HEAD/audio/alaw.c)
2020-01-09 12:28:45 +03:00
## Client Server
* [Client](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/client.c)
* [Remote Command Exec Udp Client](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/remote_command_exec_udp_client.c)
* [Remote Command Exec Udp Server](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/remote_command_exec_udp_server.c)
* [Server](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/server.c)
* [Tcp Full Duplex Client](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/tcp_full_duplex_client.c)
* [Tcp Full Duplex Server](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/tcp_full_duplex_server.c)
* [Tcp Half Duplex Client](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/tcp_half_duplex_client.c)
* [Tcp Half Duplex Server](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/tcp_half_duplex_server.c)
* [Udp Client](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/udp_client.c)
* [Udp Server](https://github.com/TheAlgorithms/C/blob/HEAD/client_server/udp_server.c)
2020-01-09 12:28:45 +03:00
2020-01-09 11:29:42 +03:00
## Conversions
* [Binary To Decimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/binary_to_decimal.c)
* [Binary To Hexadecimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/binary_to_hexadecimal.c)
* [Binary To Octal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/binary_to_octal.c)
* [C Atoi Str To Integer](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/c_atoi_str_to_integer.c)
* [Celsius To Fahrenheit](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/celsius_to_fahrenheit.c)
* [Decimal To Any Base](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_any_base.c)
* [Decimal To Binary](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_binary.c)
* [Decimal To Binary Recursion](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_binary_recursion.c)
* [Decimal To Hexa](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_hexa.c)
* [Decimal To Octal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_octal.c)
* [Decimal To Octal Recursion](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/decimal_to_octal_recursion.c)
* [Hexadecimal To Octal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/hexadecimal_to_octal.c)
* [Hexadecimal To Octal2](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/hexadecimal_to_octal2.c)
* [Infix To Postfix](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/infix_to_postfix.c)
* [Infix To Postfix2](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/infix_to_postfix2.c)
* [Int To String](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/int_to_string.c)
* [Octal To Binary](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/octal_to_binary.c)
* [Octal To Decimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/octal_to_decimal.c)
* [Octal To Hexadecimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/octal_to_hexadecimal.c)
* [Roman Numerals To Decimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/roman_numerals_to_decimal.c)
* [To Decimal](https://github.com/TheAlgorithms/C/blob/HEAD/conversions/to_decimal.c)
2020-01-09 11:29:42 +03:00
## Data Structures
* Array
* [Carray](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/array/carray.c)
* [Carray](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/array/carray.h)
* [Carray Tests](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/array/carray_tests.c)
2020-01-09 11:29:42 +03:00
* Binary Trees
* [Avl Tree](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/avl_tree.c)
* [Binary Search Tree](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/binary_search_tree.c)
* [Create Node](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/create_node.c)
* [Recursive Traversals](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/recursive_traversals.c)
* [Red Black Tree](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/red_black_tree.c)
* [Segment Tree](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/segment_tree.c)
* [Threaded Binary Trees](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/threaded_binary_trees.c)
* [Words Alphabetical](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/binary_trees/words_alphabetical.c)
2020-01-09 11:29:42 +03:00
* Dictionary
* [Dict](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dictionary/dict.c)
* [Dict](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dictionary/dict.h)
* [Test Program](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dictionary/test_program.c)
2020-04-17 16:25:08 +03:00
* Dynamic Array
* [Dynamic Array](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dynamic_array/dynamic_array.c)
* [Dynamic Array](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dynamic_array/dynamic_array.h)
* [Main](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/dynamic_array/main.c)
2020-01-09 11:29:42 +03:00
* Graphs
* [Bellman Ford](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/bellman_ford.c)
* [Bfs](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/bfs.c)
* [Bfs Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/bfs_queue.c)
* [Dfs](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/dfs.c)
* [Dfs Recursive](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/dfs_recursive.c)
* [Dijkstra](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/dijkstra.c)
* [Euler](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/euler.c)
* [Floyd Warshall](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/floyd_warshall.c)
* [Graph](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/graph.c)
* [Graph](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/graph.h)
* [Hamiltonian](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/hamiltonian.c)
* [Kruskal](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/kruskal.c)
* [Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/queue.c)
* [Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/queue.h)
* [Strongly Connected Components](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/strongly_connected_components.c)
* [Topological Sort](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/topological_sort.c)
* [Transitive Closure](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/graphs/transitive_closure.c)
2020-05-23 04:06:32 +03:00
* Hash Set
* [Hash Set](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/hash_set/hash_set.c)
* [Hash Set](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/hash_set/hash_set.h)
* [Main](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/hash_set/main.c)
2020-01-09 11:29:42 +03:00
* Heap
* [Max Heap](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/heap/max_heap.c)
* [Min Heap](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/heap/min_heap.c)
2020-01-09 11:29:42 +03:00
* Linked List
* [Ascending Priority Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/ascending_priority_queue.c)
feat: add Circular Doubly Linked List implementation (#1038) * Create circular_doubly_linked_list.c * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update circular_doubly_linked_list.c Added brief description of library files * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update circular_doubly_linked_list.c Done the all suggested changes. * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update circular_doubly_linked_list.c * updating DIRECTORY.md * updating DIRECTORY.md * updating DIRECTORY.md * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * There was typo while calling delete_first_node ! * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: David Leal <halfpacho@gmail.com> * updating DIRECTORY.md * Suggested changes are done. Done the suggested changes in functions 1. delete_first_node() 2. delete_last_node() * updating DIRECTORY.md * updating DIRECTORY.md * Worked on Suggested Changes * Suggested changes are done. * Update circular_doubly_linked_list.c Worked on all the suggested changes. Co-Authored-By: David Leal <halfpacho@gmail.com> Co-Authored-By: CascadingCascade <122662061+CascadingCascade@users.noreply.github.com> Co-Authored-By: Taj <tjgurwara99@users.noreply.github.com> * updating DIRECTORY.md * updating DIRECTORY.md * Worked on suggested changes for test cases. Check the code's functionality [here](https://leetcode.com/playground/WcRBMWa8) Co-Authored-By: CascadingCascade <122662061+CascadingCascade@users.noreply.github.com> * updating DIRECTORY.md * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: CascadingCascade <122662061+CascadingCascade@users.noreply.github.com> * Update circular_doubly_linked_list.c Update: Worked on suggested changes. * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: CascadingCascade <122662061+CascadingCascade@users.noreply.github.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: CascadingCascade <122662061+CascadingCascade@users.noreply.github.com> * Update data_structures/linked_list/circular_doubly_linked_list.c Co-authored-by: CascadingCascade <122662061+CascadingCascade@users.noreply.github.com> * Worked on suggested changes. * Minor upgrade. * updating DIRECTORY.md --------- Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: github-actions[bot] <github-actions@users.noreply.github.com> Co-authored-by: CascadingCascade <122662061+CascadingCascade@users.noreply.github.com> Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
2023-03-03 02:30:56 +03:00
* [Circular Doubly Linked List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/circular_doubly_linked_list.c)
* [Circular Linked List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/circular_linked_list.c)
* [Doubly Linked List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/doubly_linked_list.c)
* [Merge Linked Lists](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/merge_linked_lists.c)
* [Middle Element In List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/middle_element_in_list.c)
* [Queue Linked List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/queue_linked_list.c)
* [Singly Link List Deletion](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/singly_link_list_deletion.c)
* [Stack Using Linked Lists](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/stack_using_linked_lists.c)
2020-01-09 11:29:42 +03:00
* List
* [List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/list/list.c)
* [List](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/list/list.h)
* [Main](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/list/main.c)
* Queue
* [Include](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/queue/include.h)
* [Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/queue/queue.c)
* [Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack.c)
2020-01-09 11:29:42 +03:00
* Stack
* [Main](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/main.c)
* [Parenthesis](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/parenthesis.c)
* [Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/stack.c)
* [Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/stack.h)
2020-01-09 12:28:45 +03:00
* Stack Linked List
* [Main](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/stack_linked_list/main.c)
* [Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/stack_linked_list/stack.c)
* [Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/stack_linked_list/stack.h)
2020-01-09 11:29:42 +03:00
* Trie
* [Trie](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/trie/trie.c)
* [Vector](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/vector.c)
2020-01-09 11:29:42 +03:00
2021-02-18 01:39:14 +03:00
## Developer Tools
* [Malloc Dbg](https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/malloc_dbg.c)
* [Malloc Dbg](https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/malloc_dbg.h)
* [Min Printf](https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/min_printf.h)
* [Test Malloc Dbg](https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/test_malloc_dbg.c)
* [Test Min Printf](https://github.com/TheAlgorithms/C/blob/HEAD/developer_tools/test_min_printf.c)
2021-02-18 01:39:14 +03:00
## Dynamic Programming
* [Lcs](https://github.com/TheAlgorithms/C/blob/HEAD/dynamic_programming/lcs.c)
* [Matrix Chain Order](https://github.com/TheAlgorithms/C/blob/HEAD/dynamic_programming/matrix_chain_order.c)
2020-01-09 11:29:42 +03:00
## Exercism
* Acronym
* [Acronym](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/acronym/acronym.c)
* [Acronym](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/acronym/acronym.h)
2020-01-09 12:28:45 +03:00
* Hello World
* [Hello World](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/hello_world/hello_world.c)
* [Hello World](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/hello_world/hello_world.h)
2020-01-09 11:29:42 +03:00
* Isogram
* [Isogram](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/isogram/isogram.c)
* [Isogram](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/isogram/isogram.h)
2020-01-09 12:28:45 +03:00
* Rna Transcription
* [Rna Transcription](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/rna_transcription/rna_transcription.c)
* [Rna Transcription](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/rna_transcription/rna_transcription.h)
2020-01-09 12:28:45 +03:00
* Word Count
* [Word Count](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/word_count/word_count.c)
* [Word Count](https://github.com/TheAlgorithms/C/blob/HEAD/exercism/word_count/word_count.h)
2020-01-09 11:29:42 +03:00
2020-07-31 14:01:20 +03:00
## Games
* [Naval Battle](https://github.com/TheAlgorithms/C/blob/HEAD/games/naval_battle.c)
* [Tic Tac Toe](https://github.com/TheAlgorithms/C/blob/HEAD/games/tic_tac_toe.c)
2020-07-31 14:01:20 +03:00
2020-08-17 05:01:25 +03:00
## Geometry
* [Geometry Datatypes](https://github.com/TheAlgorithms/C/blob/HEAD/geometry/geometry_datatypes.h)
* [Quaternions](https://github.com/TheAlgorithms/C/blob/HEAD/geometry/quaternions.c)
* [Vectors 3D](https://github.com/TheAlgorithms/C/blob/HEAD/geometry/vectors_3d.c)
2020-08-17 05:01:25 +03:00
## Graphics
* [Spirograph](https://github.com/TheAlgorithms/C/blob/HEAD/graphics/spirograph.c)
2020-05-23 04:06:32 +03:00
## Greedy Approach
* [Dijkstra](https://github.com/TheAlgorithms/C/blob/HEAD/greedy_approach/dijkstra.c)
* [Prim](https://github.com/TheAlgorithms/C/blob/HEAD/greedy_approach/prim.c)
2020-05-23 04:06:32 +03:00
2020-01-09 11:29:42 +03:00
## Hash
* [Hash Adler32](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_adler32.c)
feat: implemented BLAKE2b cryptographic hashing algorithm (#1230) * feat: added BLAKE2b with one working assert docs: added BLAKE2b to README.md * [enhancement] added more doc comments and fully implemented BLAKE2b key hashing * fix: forgot to add arg * chore: applied clang-format * updating DIRECTORY.md * docs: added main function docs Co-authored-by: David Leal <halfpacho@gmail.com> * docs: removed @file qualifier Co-authored-by: David Leal <halfpacho@gmail.com> * docs: added doc comment for assert_bytes() Co-authored-by: David Leal <halfpacho@gmail.com> * docs: added documentation for #include's As requested by Panquesito27 in https://github.com/TheAlgorithms/C/pull/1230#discussion_r1130143641 * docs: added algorithm description As requested in https://github.com/TheAlgorithms/C/pull/1230#discussion_r1130143364 * docs: added reasoning for warning suppression pragmas * docs: spellcheck and additions Added doc for bb definition. Added description for mixing function G and compression function F. * Added print statement to let user know tests have passed Co-authored-by: David Leal <halfpacho@gmail.com> * Updated doc comments for variables * docs: removed old doc comments * fix: had minus sign instead of assignment operator * chore: replaced uint64_t[16] with block_t type to improve readability * docs: defined macro constants to reduce magic numbers * fix: fixed memory leak in blake2b() * docs: moved comment Moved comment about the suppressed warning directly above the code that emits the warning * docs: added psuedocode/feat: added u128 Added psuedocode for the algorithm in doc comment for BLAKE2B(). Added return docs for void functions. Defined an unsigned 128-bit integer to match the max input size specified for the algorithm. * fix: fixed build errors * docs: added some clarifying comments * docs: reduced magic numbers --------- Co-authored-by: github-actions[bot] <github-actions@users.noreply.github.com> Co-authored-by: David Leal <halfpacho@gmail.com>
2023-03-14 05:38:42 +03:00
* [Hash Blake2B](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_blake2b.c)
* [Hash Crc32](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_crc32.c)
* [Hash Djb2](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_djb2.c)
* [Hash Sdbm](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_sdbm.c)
* [Hash Xor8](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_xor8.c)
2020-01-09 11:29:42 +03:00
## Leetcode
* Src
* [1](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1.c)
* [10](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/10.c)
* [1008](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1008.c)
* [1009](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1009.c)
* [101](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/101.c)
* [1019](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1019.c)
* [1026](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1026.c)
* [104](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/104.c)
* [108](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/108.c)
* [1089](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1089.c)
* [109](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/109.c)
* [11](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/11.c)
* [110](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/110.c)
* [112](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/112.c)
* [1137](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1137.c)
* [1147](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1147.c)
* [118](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/118.c)
* [1184](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1184.c)
* [1189](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1189.c)
* [119](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/119.c)
* [12](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/12.c)
* [1207](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1207.c)
* [121](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/121.c)
* [124](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/124.c)
* [125](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/125.c)
* [1283](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1283.c)
* [13](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/13.c)
* [136](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/136.c)
* [14](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/14.c)
* [141](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/141.c)
* [142](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/142.c)
* [1524](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1524.c)
* [153](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/153.c)
* [16](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/16.c)
* [160](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/160.c)
* [1653](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1653.c)
* [1657](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1657.c)
* [169](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/169.c)
* [1695](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1695.c)
* [17](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/17.c)
* [1704](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1704.c)
* [173](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/173.c)
* [1752](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1752.c)
* [1769](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1769.c)
* [1833](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1833.c)
* [1838](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/1838.c)
* [189](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/189.c)
feat: implemented BLAKE2b cryptographic hashing algorithm (#1230) * feat: added BLAKE2b with one working assert docs: added BLAKE2b to README.md * [enhancement] added more doc comments and fully implemented BLAKE2b key hashing * fix: forgot to add arg * chore: applied clang-format * updating DIRECTORY.md * docs: added main function docs Co-authored-by: David Leal <halfpacho@gmail.com> * docs: removed @file qualifier Co-authored-by: David Leal <halfpacho@gmail.com> * docs: added doc comment for assert_bytes() Co-authored-by: David Leal <halfpacho@gmail.com> * docs: added documentation for #include's As requested by Panquesito27 in https://github.com/TheAlgorithms/C/pull/1230#discussion_r1130143641 * docs: added algorithm description As requested in https://github.com/TheAlgorithms/C/pull/1230#discussion_r1130143364 * docs: added reasoning for warning suppression pragmas * docs: spellcheck and additions Added doc for bb definition. Added description for mixing function G and compression function F. * Added print statement to let user know tests have passed Co-authored-by: David Leal <halfpacho@gmail.com> * Updated doc comments for variables * docs: removed old doc comments * fix: had minus sign instead of assignment operator * chore: replaced uint64_t[16] with block_t type to improve readability * docs: defined macro constants to reduce magic numbers * fix: fixed memory leak in blake2b() * docs: moved comment Moved comment about the suppressed warning directly above the code that emits the warning * docs: added psuedocode/feat: added u128 Added psuedocode for the algorithm in doc comment for BLAKE2B(). Added return docs for void functions. Defined an unsigned 128-bit integer to match the max input size specified for the algorithm. * fix: fixed build errors * docs: added some clarifying comments * docs: reduced magic numbers --------- Co-authored-by: github-actions[bot] <github-actions@users.noreply.github.com> Co-authored-by: David Leal <halfpacho@gmail.com>
2023-03-14 05:38:42 +03:00
* [19](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/19.c)
* [190](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/190.c)
* [191](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/191.c)
* [2](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2.c)
* [20](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/20.c)
* [201](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/201.c)
* [2024](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2024.c)
* [203](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/203.c)
* [206](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/206.c)
* [2095](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2095.c)
* [21](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/21.c)
* [2125](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2125.c)
* [2130](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2130.c)
* [215](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/215.c)
* [217](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/217.c)
* [2222](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2222.c)
* [223](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/223.c)
* [2256](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2256.c)
* [226](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/226.c)
* [2270](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2270.c)
* [2279](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2279.c)
* [230](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/230.c)
* [2304](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2304.c)
* [231](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/231.c)
* [234](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/234.c)
* [236](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/236.c)
* [24](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/24.c)
* [242](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/242.c)
* [2482](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2482.c)
* [2501](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/2501.c)
* [26](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/26.c)
* [268](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/268.c)
* [27](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/27.c)
* [274](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/274.c)
* [278](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/278.c)
* [28](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/28.c)
* [283](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/283.c)
* [287](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/287.c)
* [29](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/29.c)
* [3](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/3.c)
* [32](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/32.c)
* [344](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/344.c)
* [35](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/35.c)
* [367](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/367.c)
* [37](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/37.c)
* [38](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/38.c)
* [387](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/387.c)
* [389](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/389.c)
* [4](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/4.c)
* [404](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/404.c)
* [42](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/42.c)
* [442](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/442.c)
* [45](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/45.c)
* [461](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/461.c)
* [476](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/476.c)
* [485](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/485.c)
* [5](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/5.c)
* [50](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/50.c)
* [509](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/509.c)
* [520](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/520.c)
* [53](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/53.c)
* [540](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/540.c)
* [561](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/561.c)
* [567](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/567.c)
* [6](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/6.c)
* [617](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/617.c)
* [62](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/62.c)
* [63](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/63.c)
* [647](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/647.c)
* [66](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/66.c)
* [669](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/669.c)
* [674](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/674.c)
* [684](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/684.c)
* [7](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/7.c)
* [700](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/700.c)
* [701](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/701.c)
* [704](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/704.c)
* [709](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/709.c)
* [75](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/75.c)
* [771](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/771.c)
* [79](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/79.c)
* [8](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/8.c)
* [807](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/807.c)
* [82](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/82.c)
* [83](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/83.c)
* [841](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/841.c)
* [852](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/852.c)
* [876](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/876.c)
* [9](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/9.c)
* [901](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/901.c)
* [905](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/905.c)
* [917](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/917.c)
* [931](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/931.c)
* [938](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/938.c)
* [94](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/94.c)
* [953](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/953.c)
* [965](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/965.c)
* [977](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/977.c)
* [979](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/979.c)
* [98](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/98.c)
* [985](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/985.c)
* [997](https://github.com/TheAlgorithms/C/blob/HEAD/leetcode/src/997.c)
2020-01-09 11:29:42 +03:00
2020-05-31 19:44:21 +03:00
## Machine Learning
* [Adaline Learning](https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/adaline_learning.c)
* [K Means Clustering](https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/k_means_clustering.c)
* [Kohonen Som Topology](https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/kohonen_som_topology.c)
* [Kohonen Som Trace](https://github.com/TheAlgorithms/C/blob/HEAD/machine_learning/kohonen_som_trace.c)
2020-05-31 19:44:21 +03:00
## Math
* [Armstrong Number](https://github.com/TheAlgorithms/C/blob/HEAD/math/armstrong_number.c)
* [Cantor Set](https://github.com/TheAlgorithms/C/blob/HEAD/math/cantor_set.c)
* [Cartesian To Polar](https://github.com/TheAlgorithms/C/blob/HEAD/math/cartesian_to_polar.c)
* [Catalan](https://github.com/TheAlgorithms/C/blob/HEAD/math/catalan.c)
* [Collatz](https://github.com/TheAlgorithms/C/blob/HEAD/math/collatz.c)
* [Factorial](https://github.com/TheAlgorithms/C/blob/HEAD/math/factorial.c)
* [Factorial Large Number](https://github.com/TheAlgorithms/C/blob/HEAD/math/factorial_large_number.c)
* [Factorial Trailing Zeroes](https://github.com/TheAlgorithms/C/blob/HEAD/math/factorial_trailing_zeroes.c)
* [Fibonacci](https://github.com/TheAlgorithms/C/blob/HEAD/math/fibonacci.c)
* [Fibonacci Dp](https://github.com/TheAlgorithms/C/blob/HEAD/math/fibonacci_dp.c)
* [Fibonacci Fast](https://github.com/TheAlgorithms/C/blob/HEAD/math/fibonacci_fast.c)
* [Fibonacci Formula](https://github.com/TheAlgorithms/C/blob/HEAD/math/fibonacci_formula.c)
* [Gcd](https://github.com/TheAlgorithms/C/blob/HEAD/math/gcd.c)
* [Is Armstrong](https://github.com/TheAlgorithms/C/blob/HEAD/math/is_armstrong.c)
* [Large Factorials](https://github.com/TheAlgorithms/C/blob/HEAD/math/large_factorials.c)
* [Lcm](https://github.com/TheAlgorithms/C/blob/HEAD/math/lcm.c)
* [Lerp](https://github.com/TheAlgorithms/C/blob/HEAD/math/lerp.c)
* [Palindrome](https://github.com/TheAlgorithms/C/blob/HEAD/math/palindrome.c)
* [Prime](https://github.com/TheAlgorithms/C/blob/HEAD/math/prime.c)
* [Prime Factoriziation](https://github.com/TheAlgorithms/C/blob/HEAD/math/prime_factoriziation.c)
* [Prime Sieve](https://github.com/TheAlgorithms/C/blob/HEAD/math/prime_sieve.c)
* [Strong Number](https://github.com/TheAlgorithms/C/blob/HEAD/math/strong_number.c)
2020-01-09 11:29:42 +03:00
## Misc
* [Demonetization](https://github.com/TheAlgorithms/C/blob/HEAD/misc/demonetization.c)
* [Hamming Distance](https://github.com/TheAlgorithms/C/blob/HEAD/misc/hamming_distance.c)
* [Lexicographic Permutations](https://github.com/TheAlgorithms/C/blob/HEAD/misc/lexicographic_permutations.c)
* [Longest Subsequence](https://github.com/TheAlgorithms/C/blob/HEAD/misc/longest_subsequence.c)
* [Mirror](https://github.com/TheAlgorithms/C/blob/HEAD/misc/mirror.c)
* [Pid](https://github.com/TheAlgorithms/C/blob/HEAD/misc/pid.c)
* [Poly Add](https://github.com/TheAlgorithms/C/blob/HEAD/misc/poly_add.c)
* [Postfix Evaluation](https://github.com/TheAlgorithms/C/blob/HEAD/misc/postfix_evaluation.c)
* [Quartile](https://github.com/TheAlgorithms/C/blob/HEAD/misc/quartile.c)
* [Rot13](https://github.com/TheAlgorithms/C/blob/HEAD/misc/rot13.c)
* [Rselect](https://github.com/TheAlgorithms/C/blob/HEAD/misc/rselect.c)
* [Run Length Encoding](https://github.com/TheAlgorithms/C/blob/HEAD/misc/run_length_encoding.c)
* [Shunting Yard](https://github.com/TheAlgorithms/C/blob/HEAD/misc/shunting_yard.c)
* [Sudoku Solver](https://github.com/TheAlgorithms/C/blob/HEAD/misc/sudoku_solver.c)
* [Tower Of Hanoi](https://github.com/TheAlgorithms/C/blob/HEAD/misc/tower_of_hanoi.c)
* [Union Find](https://github.com/TheAlgorithms/C/blob/HEAD/misc/union_find.c)
2020-01-09 11:29:42 +03:00
2020-04-08 22:31:36 +03:00
## Numerical Methods
* [Durand Kerner Roots](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/durand_kerner_roots.c)
* [Gauss Elimination](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/gauss_elimination.c)
* [Gauss Seidel Method](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/gauss_seidel_method.c)
* [Lagrange Theorem](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/lagrange_theorem.c)
* [Lu Decompose](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/lu_decompose.c)
* [Mean](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/mean.c)
* [Median](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/median.c)
* [Newton Raphson Root](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/newton_raphson_root.c)
* [Ode Forward Euler](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/ode_forward_euler.c)
* [Ode Midpoint Euler](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/ode_midpoint_euler.c)
* [Ode Semi Implicit Euler](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/ode_semi_implicit_euler.c)
* [Qr Decompose](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/qr_decompose.h)
* [Qr Decomposition](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/qr_decomposition.c)
* [Qr Eigen Values](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/qr_eigen_values.c)
* [Realtime Stats](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/realtime_stats.c)
* [Simpsons 1 3Rd Rule](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/simpsons_1_3rd_rule.c)
* [Variance](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/variance.c)
2020-04-08 22:31:36 +03:00
feat: add `non_preemptive_priority_scheduling` in Process Scheduling Algorithm (#968) * Added NonPreemptivePriorityScheduling * updating DIRECTORY.md * Added documentation and tests * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Left out documentation and suggested changes * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * test case added with assert.h * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: Taj <tjgurwara99@users.noreply.github.com> * typedef | Snake Case naming * chore: apply suggestions from code review Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
2022-11-17 21:19:16 +03:00
## Process Scheduling Algorithms
* [Non Preemptive Priority Scheduling](https://github.com/TheAlgorithms/C/blob/HEAD/process_scheduling_algorithms/non_preemptive_priority_scheduling.c)
feat: add `non_preemptive_priority_scheduling` in Process Scheduling Algorithm (#968) * Added NonPreemptivePriorityScheduling * updating DIRECTORY.md * Added documentation and tests * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Left out documentation and suggested changes * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: David Leal <halfpacho@gmail.com> * test case added with assert.h * Update process_scheduling_algorithms/non_preemptive_priority_scheduling.c Co-authored-by: Taj <tjgurwara99@users.noreply.github.com> * typedef | Snake Case naming * chore: apply suggestions from code review Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: Taj <tjgurwara99@users.noreply.github.com>
2022-11-17 21:19:16 +03:00
2020-01-09 11:29:42 +03:00
## Project Euler
2020-05-29 23:14:13 +03:00
* Problem 1
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_1/sol1.c)
* [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_1/sol2.c)
* [Sol3](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_1/sol3.c)
* [Sol4](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_1/sol4.c)
2020-03-30 06:23:46 +03:00
* Problem 10
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_10/sol1.c)
* [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_10/sol2.c)
2020-03-30 07:37:29 +03:00
* Problem 12
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_12/sol1.c)
2020-03-30 22:49:42 +03:00
* Problem 13
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_13/sol1.c)
2020-03-30 22:49:42 +03:00
* Problem 14
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_14/sol1.c)
2020-03-30 22:49:42 +03:00
* Problem 15
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_15/sol1.c)
2020-03-30 22:49:42 +03:00
* Problem 16
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_16/sol1.c)
2020-04-01 19:11:46 +03:00
* Problem 19
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_19/sol1.c)
2020-05-29 23:14:13 +03:00
* Problem 2
* [So1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_2/so1.c)
2020-04-03 03:16:37 +03:00
* Problem 20
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_20/sol1.c)
2020-04-02 04:10:10 +03:00
* Problem 21
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_21/sol1.c)
* Problem 22
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_22/sol1.c)
2020-04-02 20:27:59 +03:00
* Problem 23
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_23/sol1.c)
* [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_23/sol2.c)
2020-04-03 03:16:37 +03:00
* Problem 25
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_25/sol1.c)
2020-04-03 06:51:13 +03:00
* Problem 26
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_26/sol1.c)
2020-05-29 23:14:13 +03:00
* Problem 3
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_3/sol1.c)
* [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_3/sol2.c)
2020-05-29 23:14:13 +03:00
* Problem 4
* [Sol](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_4/sol.c)
2020-04-24 00:00:06 +03:00
* Problem 401
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_401/sol1.c)
2020-05-29 23:14:13 +03:00
* Problem 5
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_5/sol1.c)
* [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_5/sol2.c)
* [Sol3](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_5/sol3.c)
2020-05-29 23:14:13 +03:00
* Problem 6
* [Sol](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_6/sol.c)
2020-05-29 23:14:13 +03:00
* Problem 7
* [Sol](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_7/sol.c)
* [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_7/sol2.c)
2020-05-29 23:14:13 +03:00
* Problem 8
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_8/sol1.c)
* [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_8/sol2.c)
2020-05-29 23:14:13 +03:00
* Problem 9
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_9/sol1.c)
* [Sol2](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_9/sol2.c)
2020-01-09 11:29:42 +03:00
## Searching
* [Binary Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/binary_search.c)
* [Exponential Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/exponential_search.c)
* [Fibonacci Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/fibonacci_search.c)
* [Floyd Cycle Detection Algorithm](https://github.com/TheAlgorithms/C/blob/HEAD/searching/floyd_cycle_detection_algorithm.c)
* [Interpolation Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/interpolation_search.c)
* [Jump Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/jump_search.c)
* [Linear Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/linear_search.c)
* [Modified Binary Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/modified_binary_search.c)
* [Other Binary Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/other_binary_search.c)
2020-01-09 11:29:42 +03:00
* Pattern Search
* [Boyer Moore Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/pattern_search/boyer_moore_search.c)
* [Naive Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/pattern_search/naive_search.c)
* [Rabin Karp Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/pattern_search/rabin_karp_search.c)
* [Sentinel Linear Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/sentinel_linear_search.c)
* [Ternary Search](https://github.com/TheAlgorithms/C/blob/HEAD/searching/ternary_search.c)
2020-01-09 11:29:42 +03:00
## Sorting
* [Bead Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bead_sort.c)
* [Binary Insertion Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/binary_insertion_sort.c)
* [Bogo Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bogo_sort.c)
* [Bubble Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bubble_sort.c)
* [Bubble Sort 2](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bubble_sort_2.c)
* [Bubble Sort Recursion](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bubble_sort_recursion.c)
* [Bucket Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/bucket_sort.c)
* [Cocktail Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/cocktail_sort.c)
* [Comb Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/comb_sort.c)
* [Counting Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/counting_sort.c)
* [Cycle Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/cycle_sort.c)
* [Gnome Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/gnome_sort.c)
* [Heap Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/heap_sort.c)
* [Heap Sort 2](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/heap_sort_2.c)
* [Insertion Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/insertion_sort.c)
* [Insertion Sort Recursive](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/insertion_sort_recursive.c)
* [Merge Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/merge_sort.c)
* [Merge Sort Nr](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/merge_sort_nr.c)
* [Multikey Quick Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/multikey_quick_sort.c)
* [Odd Even Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/odd_even_sort.c)
* [Pancake Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/pancake_sort.c)
* [Partition Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/partition_sort.c)
* [Patience Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/patience_sort.c)
* [Pigeonhole Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/pigeonhole_sort.c)
* [Quick Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/quick_sort.c)
* [Radix Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/radix_sort.c)
* [Radix Sort 2](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/radix_sort_2.c)
* [Random Quick Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/random_quick_sort.c)
* [Selection Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/selection_sort.c)
* [Selection Sort Recursive](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/selection_sort_recursive.c)
* [Shaker Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/shaker_sort.c)
* [Shell Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/shell_sort.c)
* [Shell Sort2](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/shell_sort2.c)
* [Stooge Sort](https://github.com/TheAlgorithms/C/blob/HEAD/sorting/stooge_sort.c)