Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Documentation #62

Closed
wants to merge 3 commits into from
Closed

Documentation #62

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
0969a68
Add documentation for Sorting
fakabbir Jun 4, 2017
dac1877
Update readme.md
fakabbir Jun 4, 2017
6ce081e
Update readme.md
fakabbir Jun 4, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 12 additions & 0 deletions Sorting/readme.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
# Sorting Algorithms
Sorting Algorithms are one among the important algortihms because of the fact that it could reduce the complexity of the requiered operations after the processing to very effective. The simple example being searching. For an unordered list the time complextity of the most effective algoritm would be of the order O(n). While after sorting the complexity could be reduced to the order of log (n). Sorting refers to arranging data a_1 , a_2, a_3, ...., a_i ,..... a_n such that for every indexing parameter i > j , a_i > a_j . Most common ordering is based on lexicographical ordeer or numerical order.
Below is the list of variuos sorting algorithms :
* Bubble Sort
* Counting Sort
* Heap Sort
* Insertion Sort
* Merge Sort
* Quick Sort
* Selection Sort
* Shell Sort