mirror of
https://github.com/TheAlgorithms/C
synced 2024-11-22 05:21:49 +03:00
2e8374e5c1
* chore: free-dependency LeetCode directory writer * updating DIRECTORY.md --------- Co-authored-by: github-actions[bot] <github-actions@users.noreply.github.com>
360 lines
27 KiB
Markdown
360 lines
27 KiB
Markdown
|
|
## Audio
|
|
* [Alaw](https://github.com/TheAlgorithms/C/blob/HEAD/audio/alaw.c)
|
|
|
|
## Cipher
|
|
* [Affine](https://github.com/TheAlgorithms/C/blob/HEAD/cipher/affine.c)
|
|
* [Rot13](https://github.com/TheAlgorithms/C/blob/HEAD/cipher/rot13.c)
|
|
|
|
## 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)
|
|
|
|
## 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)
|
|
|
|
## 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)
|
|
* 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)
|
|
* 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)
|
|
* 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)
|
|
* 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)
|
|
* 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)
|
|
* 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)
|
|
* Linked List
|
|
* [Ascending Priority Queue](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/linked_list/ascending_priority_queue.c)
|
|
* [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)
|
|
* 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)
|
|
* Stack
|
|
* [Dynamic Stack](https://github.com/TheAlgorithms/C/blob/HEAD/data_structures/stack/dynamic_stack.c)
|
|
* [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)
|
|
* 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)
|
|
* 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)
|
|
|
|
## 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)
|
|
|
|
## 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)
|
|
|
|
## 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)
|
|
* 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)
|
|
* 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)
|
|
* 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)
|
|
* 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)
|
|
|
|
## Games
|
|
* [Hangman](https://github.com/TheAlgorithms/C/blob/HEAD/games/hangman.c)
|
|
* [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)
|
|
|
|
## 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)
|
|
|
|
## Graphics
|
|
* [Spirograph](https://github.com/TheAlgorithms/C/blob/HEAD/graphics/spirograph.c)
|
|
|
|
## 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)
|
|
|
|
## Hash
|
|
* [Hash Adler32](https://github.com/TheAlgorithms/C/blob/HEAD/hash/hash_adler32.c)
|
|
* [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)
|
|
|
|
## 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)
|
|
|
|
## 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)
|
|
* [Euclidean Algorithm Extended](https://github.com/TheAlgorithms/C/blob/HEAD/math/euclidean_algorithm_extended.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)
|
|
|
|
## 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)
|
|
* [Mcnaughton Yamada Thompson](https://github.com/TheAlgorithms/C/blob/HEAD/misc/mcnaughton_yamada_thompson.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)
|
|
* [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)
|
|
|
|
## Numerical Methods
|
|
* [Bisection Method](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/bisection_method.c)
|
|
* [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)
|
|
* [Secant Method](https://github.com/TheAlgorithms/C/blob/HEAD/numerical_methods/secant_method.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)
|
|
|
|
## Process Scheduling Algorithms
|
|
* [Non Preemptive Priority Scheduling](https://github.com/TheAlgorithms/C/blob/HEAD/process_scheduling_algorithms/non_preemptive_priority_scheduling.c)
|
|
|
|
## Project Euler
|
|
* 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)
|
|
* 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)
|
|
* Problem 12
|
|
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_12/sol1.c)
|
|
* Problem 13
|
|
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_13/sol1.c)
|
|
* Problem 14
|
|
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_14/sol1.c)
|
|
* Problem 15
|
|
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_15/sol1.c)
|
|
* Problem 16
|
|
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_16/sol1.c)
|
|
* Problem 19
|
|
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_19/sol1.c)
|
|
* Problem 2
|
|
* [So1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_2/so1.c)
|
|
* Problem 20
|
|
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_20/sol1.c)
|
|
* 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)
|
|
* 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)
|
|
* Problem 25
|
|
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_25/sol1.c)
|
|
* Problem 26
|
|
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_26/sol1.c)
|
|
* 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)
|
|
* Problem 4
|
|
* [Sol](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_4/sol.c)
|
|
* Problem 401
|
|
* [Sol1](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_401/sol1.c)
|
|
* 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)
|
|
* Problem 6
|
|
* [Sol](https://github.com/TheAlgorithms/C/blob/HEAD/project_euler/problem_6/sol.c)
|
|
* 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)
|
|
* 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)
|
|
* 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)
|
|
|
|
## 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)
|
|
* 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)
|
|
|
|
## 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)
|