Commit Graph

1432 Commits

Author SHA1 Message Date
Ashwek Swamy
ff41e4a60c
Update Paranthesis Matching.cpp 2018-11-13 22:32:40 +05:30
Md Rafi Akhtar
81867d8ce6 DP program: Catalan numbers 2018-11-11 00:09:53 +05:30
Ashwek Swamy
70d42cd072
Create Counting_Sort.cpp 2018-11-01 12:05:30 +05:30
Deepak-j-p
15315d6047
Implemented sort for string
Implemented a counting sort for string in cpp
2018-10-31 09:48:26 +05:30
Gopikrishnan Rajeev
227dcf0525
Added and algorithm to check if a number is palindrome
Added the algorithm to convert number to string and check if it's a palindrome.
2018-10-31 00:05:32 +05:30
Ashwek Swamy
62c1c5e956
Update Stack Using Array.cpp
dynamically allocating memory to `stack` according to size given by user as input
2018-10-27 21:18:51 +05:30
Ishmeet-Singh-Saggu
e8fd1df48f
Update README.md 2018-10-27 16:08:15 +05:30
Ashwek Swamy
14fd8c7821
Update Bubble Sort.cpp
reduced the number of iteration done be inner for loop used for sorting to improve efficiency.
2018-10-23 18:42:36 +05:30
Ashwek Swamy
7989930107
Added Proper Indentation
Added proper indentation and using shorthand.
2018-10-23 18:01:24 +05:30
Ashwek Swamy
73fa353b0a
Reduced Lines of code
Using a "HexValues" string to store the possible hex values(0-9 A-F).
Changed "void main" to "int main"
2018-10-23 17:47:43 +05:30
Space
68c93d8efb Added new Algorithms to compute power for such numbers whose answer is too big(For instance 1 followed by thousand zeroes).
Using old multiplicatiion method will render invalid result for such
huge numbers(To be presise one would get 0 in case of C++14).
2018-10-21 22:55:50 +05:30
Rakesh
540a2e494a
Update Happy_number.cpp 2018-10-16 18:18:48 +05:30
Rakesh
afe1ff3b6a
Update String Fibonacci.cpp 2018-10-16 18:16:37 +05:30
Rakesh
a874772229
Delete s[i]
Redundant file
2018-10-16 18:04:32 +05:30
yashmunoth
81561e6a74
Program for Huffman Coding in C++ 2018-10-15 23:04:45 +05:30
Mohit Sharma
16e1bcdb52
Merge pull request #135 from shrutisheoran/shrutisheoran/MorrisInorder_Binary_Tree
Add Morris Inorder Algorithm (Binary Tree)
2018-10-11 13:37:31 +05:30
Mohit Sharma
b204b5ecd5
Merge pull request #136 from shrutisheoran/AVLTree_shrutisheoran
Add deletion function
2018-10-11 13:37:11 +05:30
Shruti Sheoran
e34368fcb6 Add deletion function 2018-10-11 12:53:27 +05:30
Shruti Sheoran
62834c1432 Add Morris Inorder Algorithm (Binary Tree) 2018-10-11 11:54:29 +05:30
Mohit Sharma
8e924d7561
Merge pull request #134 from shrutisheoran/AVLTree_shrutisheoran
AVL Tree(Balanced BST)
2018-10-11 10:49:37 +05:30
Shruti Sheoran
7698ff7b91 AVL Tree(Balanced BST) 2018-10-11 10:45:50 +05:30
Mohit Sharma
f3f1536d74
Merge pull request #133 from shubhamguptaji/TrieTree
Trie Tree
2018-10-11 10:09:20 +05:30
shubhamguptaji
975cefb62b comments added 2018-10-11 09:57:49 +05:30
shubhamguptaji
cbef5275bb Trie Tree 2018-10-11 09:50:16 +05:30
ojas1234
f142e8c714 Binaryheap 2018-10-04 23:35:31 +05:30
Mayank Khanna
5282f26897
Typo fix in README.md 2018-10-04 00:58:53 +05:30
Piyush
df74e656a2 add: sort technique using vectors 2018-10-02 23:16:58 +05:30
Vaibhav Gupta
485d1b2bb8
solve bus-error (core dumped), run-time error
- Run time error on linux.
  - 'n' is declared but not initialized, neither its value is taken from user.
  - 'n' contains garbage value, thus throws run time error.
2018-10-02 17:05:25 +05:30
Vaibhav Gupta
f499342869
Optimize bubble sort algorithm
-introduced variable 'swap' for 'outer-for-loop' of bubble sort algorithm. If it remains zero after executing inner-loop, it means array is sorted, hence it does not need to run for n^2 times.
- 'for(int j=0; j<n-1-i; j++)', as after each step, one number reaches to its right position. Thus inner loop does not need to run for 'n' times in every cycle.
2018-10-02 16:34:16 +05:30
Ayush Nagar
bb46f062dc
median search=> 2018-10-02 12:00:43 +05:30
Aruj Sharma
d72b48e5ee
Create BitonicSort.cpp 2018-10-02 10:26:44 +05:30
Nikhil Arora
c7b69429c1 added knight tour to backtracking and longest common string to dynamic 2018-10-02 01:05:40 +05:30
Manas Khosla
de2f69a10a
Added EXIT option and some fine-tunings
Added EXIT option in the menu for getting out of the loop and added lines between printing the list and choices for fine-tuning the output.
2018-09-28 23:41:01 +05:30
Pradeep Singh
b5de696aed
added a new implementation of linked list 2018-09-28 18:48:24 +05:30
Emre Doğan
4ff86897b1
n is now taken as an input. 2018-09-26 00:19:09 +03:00
CrazyMerlyn
0e3b07ec47 Fix bugs in edit distance implementation 2018-09-16 16:47:02 +05:30
Rohit Gupta
aead0ba366
Merge pull request #98 from khanna98/master
Circular Queue using Linked List
2018-09-16 00:14:02 +05:30
Kaushal Agrawal
28e4842319
Update sieve_of_Eratosthenes.cpp
Multiple changes:
Time complexity updated.
Fixed Indentation issues.
Global array primes[ ] was misleading because primes[x] = 0 means x is prime. Updated the array name to isprime[ ] and now isprime[x] = 1 means x is prime. Updated the code accordingly.
2018-09-13 05:57:56 +05:30
DDullahan
1f5533c77f Added FenwickTree For Range Query 2018-08-29 22:48:13 +08:00
Mayank Khanna
2d39a0ef59 Circular Queue using Linked List 2018-08-16 14:24:25 +05:30
soulzstriker
210a0d47f4 Clean up the HTML comments 2018-08-02 17:02:37 +08:00
Christian Bender
24794d8f08
Merge pull request #95 from Split174/Smallest-circle-problem
naive algorithm for the circumscribed circle
2018-05-18 22:58:32 +02:00
Sergey Popov
f49bb23f4b naive algorithm for the circumscribed circle 2018-04-29 22:28:49 +05:00
PARISOT paul andrea
ef377b0807 implementation of the odd even sort 2018-04-27 15:48:55 +02:00
Christian Bender
f859394232
Merge pull request #93 from linus-xuzixuan/patch-1
Edits #include directives
2018-04-22 19:14:11 +02:00
linus-xuzixuan
4fe2cf67b9
Edits #include directives
My computer doesn't seem to have the stdc++.h, so I tried changing it to the two headers really used.
2018-04-22 00:52:40 +08:00
Christian Bender
f9490839b6
Merge pull request #92 from vasutomar/Hashing
Super! Keep it up!
2018-04-19 16:21:15 +02:00
vasutomar
f3f0e88ad9 Hashing with collision resolution 2018-04-18 18:09:35 +05:30
vasutomar
37a2be33b7 Hashing with collision resolution 2018-04-18 18:06:51 +05:30
vasutomar
7747d3a6c3 Hashing implementation with chaining collision resolution 2018-04-17 14:12:30 +05:30