mirror of
https://github.com/TheAlgorithms/C
synced 2024-11-22 05:21:49 +03:00
8d240037b3
1) Easy logic built 2) error minimized: as array is increasing in above example it might not always be increasing.just replace 47 by 2 then run above program it will give an incorrect ans. but in improvised case it is minimized. 3)we are scanning input from user so, more saturated 4)'position' is more reliable than 'index'. |
||
---|---|---|
Computer Oriented Statistical Methods | ||
computer-oriented-statistical-methods | ||
conversions | ||
Conversions | ||
Data Structures | ||
data_structures | ||
exercism | ||
Hash | ||
misc | ||
Project Euler | ||
Searches | ||
sorting | ||
Sorts | ||
README.md |
C
Computer Oriented Statistical Methods
- Gauss_Elimination
- Lagrange_Theorem
- Mean
- Median
- Seidal
- Simpson's_1-3rd_rule.c
- Variance
- statistic (C Lib)
Conversions
- binary_to_decimal
- decimal _to_binary
- decimal_to_hexa
- decimal_to_octal
- to_decimal
Data Structures
- stack
- queue
- dictionary
linked_list
- singly_link_list_deletion
- stack_using_linkedlists
binary_trees
- create_node
- recursive_traversals
trie
- trie
Searching
- Binary_Search
- Other_Binary_Search
- Jump_Search
Sorting
- binary_insertion_sort
- BubbleSort
- BogoSort
- InsertionSort
- mergesort
- OtherBubbleSort
- QuickSort
- SelectionSort
- shaker_sort
- HeapSort
Hashing
- sdbm
- djb2
- xor8 (8 bit)
- adler_32 (32 bit)
Misc
- Binning
- Factorial
- Fibonacci
- isArmstrong
- LongestSubSequence
- palindrome
- QUARTILE
- rselect
- strongNumber
- TowerOfHanoi
- Greatest Common Divisor
exercism
In this directory you will find (in the right order):
- hello-world
- isogram
- acronym
- word-count
- rna-transcription