Computer Oriented Statistical Methods
- Gauss_Elimination
- Lagrange_Theorem
- Mean
- Median
- Seidal
- Simpson's_1-3rd_rule.c
- Variance
Conversions
- N base to M base
- binary_to_decimal
- binary_to_hexa
- binary_to_octal
- decimal _to_binary
- decimal_to_hexa
- decimal_to_octal
- toDecimal
Data Structures
- Dynamic_stack
- HuffmanCoding
- Dynamic_queue
- UnionFind
Array
- CArray
- CArrayTests
stack
- Reverseing_Stack
- main
- parenthesis
- stack
dictionary
- dict
- test_program
linked_list
- singly_link_list_deletion
- stack_using_linkedlists
- double_lincked_list
- circular_lincked_list
- FindMiddle_List
- LinkedList_length
- ReverseSearch_List
- Reversing_List
- mergeLinkedLists
binary_trees
- AVL Tree
- Diameter of BST
- Diameter of BST_efficient
- Find_height
- Left-leaning red black tree
- Merte_2_Balanced_BST
- Splay Tree_Insert
- Splay Tree_Search
- Threaded_binary_tree
- binary_search_tree
- create_node
- recursive_traversals
trie
- trie
graphs
- base_Graph
- Bellman-Ford
- Boruvka's Algorithm
- Dijkstra's Algorithm
- Dijkstra's Algoritm example
- Floyd-Warshall
- HamiltonianCycle
exercism
- hello-world
- isogram
- acronym
- word-count
- rna-transcription
- bulls-and-cows
- wildcard
- Gomoku
Searching
pattern_search
- Binary_Search
- Other_Binary_Search
- Jump_Search
- BFS
- DFS
- LinearSearch
- binarys
- fibonacciSearch
- interpolation_search
- modifiedBinarySearch
Sorting
- BinaryInsertionSort
- BubbleSort
- BogoSort
- Gnome Sort
- InsertionSort
- InsertionSort_Recursive
- MergeSort
- OtherBubbleSort
- QuickSort
- QuickSort_Iterative
- QuickSort_SingleLinkedList
- QuickSort_DoubleLinkedList
- SelectionSort
- ShakerSort
- TimSort
- TreeSort
- HeapSort
- PancakeSort
- radix
- MergeSortforLinkedLists
Hashing
- sdbm
- djb2
- xor8 (8 bit)
- adler_32 (32 bit)
- UnderstandingHashTable.c
Misc
- Binning
- Factorial
- Fibonacci
- isArmstrong
- LongestSubSequence
- palindrome
- QUARTILE
- rselect
- strongNumber
- TowerOfHanoi
- Greatest Common Divisor
- GCD_BruteForce
- GCD_BruteForce+
- Hemisphere
- Sudoku Solver
- prime factorization
Project_euler
- Problem 01
- Problem 02
- Problem 03
- Problem 04
- Problem 05
- Problem 06
- Problem07
Simple Client Server Implementation
- client.c
- server.c
First execute server.c in a terminal and then client.c in a different terminal. Enables communication between two terminals.
Bit_algorithm
- find_sigle_number.c
- detect_opposite_signs.c
- swap_bits.c
- add_two_numbers.c
- smallest_of_three.c
- boolean_array_puzzle.c
- next_higher_number.c
- binary_representation_of_a_given_Number.c
- check_if_a_number_is_multiple_of_3.c
- check_if_a_number_is_multiple_of_9.c
- check_if_binary_representation_of_a_number_is_palindrome.c
- count_number_of_bits_to_be_flipped_to_conver_a_to_b.c
- count_set_bits_in_an_integer.c
- find_party.c
- find_position_of_the_only_set_bit.c
- find_whether_a_np_is_power_of_two.c
- how_to_swap_two_numbers_without_using_a_temporary_variable.c
- how_to_turn_off_a_particular_bit_in_a_number.c
- Karatsuba_algorithm.c
- little_and_big_endian_mystery.c
- multiply_with_7.c
- next_power_of_2.c
- position_of_rightmost_set_bit.c
- reverese_bits_of_a_number.c
- swap_all_odd_and_even_bits.c
- swap_two_nibbles_in_a_byte.c
Backtracking
- Boolean_array_puzzle.c
- Kight_Tour.c
- N_Queen_Problem.c
- Print_permutation.c
- Rat_maze.c
- m_coloring.c
- subset_sum.c
- subset_sum_2.c
- sudoku.c
Dynamic_Programming
- Binomal_Coeffiecient.c
- Count_number_of_ways_to_reach_a_given_score_in_a_game.c
- Egg_Dropping_Puzzle.c
- Floyd_Warshall_Argorithm.c
- Knapsack_Problem.c
- Largest_Independent_Set_Problem.c
- Longest_Common_Subsequence.c
- Longest_Even_Length_Substring.c
- Longest_Increasing_Subsequence.c
- Longest_Palindromic_Subsequence.c
- Matirx_Chain_Multipulication.c
- Maximum_Sum_Increasing_Subsequence.c
- Maximum_Sum_rectangle_in_a_2D_matrix.c
- Min_Cost_Path.c [Add] Min Cost Path
- Optimal_Binary_Search_Tree.cc
- Overlapping_Subproblems_Property.c
- Palindrome_Partitioning.c
- Partition_Problem
- Partition_Problem.c
- Ugly_Numbers.c
- Vertex_Cover_Problem.c