A Repository to store implementation of some of the famous Data Structures and Algorithms (mainly in C/C++/Java/Python) for everyone to learn and contribute.
I think it would be better if we create a separate folder for sorting algorithms in python as there might be people who only know Python and might know C or C++
As a result it might become difficult for them to comprehend the sorting algos in C and C++
Therefore I'd like to assign this task of creating a separate folder with Sorting algos in Python and write a couple of sorting algos into it too!
This issue cover following algorithms:
1.Gradient descent
2.Normalize equation
for different model such as linear regression, polynomial regression and logistic regression.
I wanna upload some resources here, for everyone to know the basics. I came across these resources in another repo and I feel it will help everyone more.
I will be uploading the codes for these alongside as well
Segment trees are very useful for range queries. Segment trees do the update and query operation in log(n) time. They are binary trees in which the given array is modified into a tree which help in solving the query.
There is a file containing all the operations that can be performed on a linked list in Algorithms/Competitive Coding/Linked List but it's only pointer based.
I would like to add an array based 'Linked_list_operation' file using C++ and if allowed I would like to rename the current one to 'Linked_list_operation_based_on_pointers'
STEPS TO REPRODUCE
Adding the new file containing Linked List operations based on array
Renaming the current file to 'Linked_list_operation_based_on_pointers'
EXPECTED OUTCOME
The repository will now have both array based and pointer based Linked List operations files.
ACTUAL OUTCOME
--
Proposed Solution
I would like to add an array based 'Linked_list_operation' file using C++ and if allowed I would like to rename the current one to 'Linked_list_operation_based_on_pointers'
Randomized version of quicksort is mostly implemented in real life and is missing in the repo as it is the randomized quicksort which gives it the worst case O(nlogn) complexity and not the naive implementation.
STEPS TO REPRODUCE
EXPECTED OUTCOME
Code of randomized quicksort will be added.
ACTUAL OUTCOME
Proposed Solution [optional]
I will like to add the randomized quicksort in the quicksort folder.
Instead of searching all the through the list, how about creating folders like Bit manipulation, dynamic programming , greedy algorithms and so on. This would create a neat and tidy repo
There are some study materials and READMEs here and there all over the repository. Since this repo was meant for people to get a compiled list of algorithms, I think it would be better to just create a site and post all the study materials there. That would make it more readable and easily accessible.
I have created a jekyll blog, that can be accessed using codeiiest.github.io/Algorithms. Check the gh-pages branch for contributing.
WIll we implementing a few math based algorithms like:
(1) Factorial
(2) Fibonacci Series
(3) Project Euler problem-1
(4) An algorithm for a Random Number Generator
STEPS TO REPRODUCE
Will be coding the following algorithms in C,C++ or Python.
Proposed Solution [optional]
I'd like this issue to be assigned to me so that I can implement the following.
adding stack program in cpp . stack is abstract data type with two principle operations push and pop.
STEPS TO REPRODUCE
Please list the steps to reproduce the above problem
EXPECTED OUTCOME
push,pop,peek operations will tested with an array and push will add elements ,pop will destroy the topmost element peek will be used to view topmost element
ACTUAL OUTCOME
same as expected.
Proposed Solution [optional]
upload the code for the operations.
i am assigning it to myself and adding the program in cpp
Pre-order :-
visit the root node
traverse the left sub-tree
traverse the right sub-tree
In-order :-
traverse the left sub-tree
visit the root node
traverse the left sub-tree
Post-order :-
traverse the left sub-tree
traverse the right sub-tree
visit the root node
I want to propose new commits which include files containing a number of important algorithms in C or C++ .
STEPS TO REPRODUCE
New commits can be added with the required algorithms.
EXPECTED OUTCOME
A rich repository with a number of useful algorithms for student purpose like linked lists, stacks,queues,circular queues ,searching and sorting techniques etc.
What did you expect to happen
ACTUAL OUTCOME
The proposed outcome
Proposed Solution [optional]
If you know how to solve the above, please provide details here.
Given n activities with their start and finish times, Select the maximum number of activities that can be performed by a single person, assuming that a person can only work on a single activity at a time.