Open alayek opened 8 years ago
@varunu28 do you think we should add Big-O notation under this epic?
@alayek I think we should remove the Big-O notation article from DS and put it under here. There would be a topic in the starting where the Big-O notation would be explained and then for every algorithm article we would have a small topic where we would explain Big-O notation for that algorithm.
@alayek In the above issue what algorithms do we need to mention under in-place sorting and in-order sorting as algorithms like heap sort and quick sort are considered as in-place algorithms? Do we need to just explain what is meant by in-place and in-order sorting?
@alayek I want to get started with the bubble sort. Please assign that to me.
@varunu28 yes, you need to clearly mention what is meant by those terms, and explain with examples, why the examples satisfy those terms.
Assigned.
Please assign me insertion sort. Add shell sort, counting sort and a section for searching algorithms too.
ok. done @jainaman224
Can you please see #1056 for insertion sort.
@alayek I am done with BubbleSort. I will start with selection sort. Please assign that to me
@varunu28, added you!
@atjonathan I believe MergeSort has already been pushed so it can probably be removed unless the current article isn't sufficient. Also, I'm going to begin working on an article for Big-O notation so please assign that one to me.
@angregor, thanks!
@angregor thanks for pointing out. That article requires some updating and modification with more code examples in Python/Java/C++.
We will update the existing one.
Kindly update the list with #1172 for Binary Search.
@dakshshah96 done :+1:
Please assign Searching - Naive Search to me.
I will write on Greedy algorithms. If you wish to! @alayek
[Note: Not to confuse with our algorithm challenges in JavaScript]
We need solid articles on following Algorithm-related topics (similar to #1044 ):
It should be made clear to the reader in the article, that for all of these, libraries exist, and that in production, they should use that. However, this can be helpful in a technical interview.
The implementation section should have language based subsections in lexicographical order.