You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
3
+
3
4
4
5
<br/>
5
6
@@ -8,184 +9,38 @@ A Repository to store implementation of some of the famous Data Structures and A
8
9
9
10
[](https://gitter.im/codeIIEST/Algorithms?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
From [Wikipedia][bubble-wiki]: Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.
21
-
22
-
__Properties__
23
-
* Worst case performance O(n^2)
24
-
* Best case performance O(n)
25
-
* Average case performance O(n^2)
26
-
27
-
###### View the algorithm in [action][bubble-toptal]
28
-
29
-
30
-
31
-
### Insertion
32
-
![alt text][insertion-image]
33
-
34
-
From [Wikipedia][insertion-wiki]: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
35
-
36
-
__Properties__
37
-
* Worst case performance O(n^2)
38
-
* Best case performance O(n)
39
-
* Average case performance O(n^2)
40
-
41
-
###### View the algorithm in [action][insertion-toptal]
42
-
43
-
44
-
### Merge
45
-
![alt text][merge-image]
46
-
47
-
From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945.
48
-
49
-
__Properties__
50
-
* Worst case performance O(n log n)
51
-
* Best case performance O(n)
52
-
* Average case performance O(n)
53
-
54
-
55
-
###### View the algorithm in [action][merge-toptal]
56
-
57
-
### Quick
58
-
![alt text][quick-image]
59
-
60
-
From [Wikipedia][quick-wiki]: Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.
61
-
62
-
__Properties__
63
-
* Worst case performance O(n^2)
64
-
* Best case performance O(n log n) or O(n) with three-way partition
65
-
* Average case performance O(n log n)
66
-
67
-
###### View the algorithm in [action][quick-toptal]
68
-
69
-
### Selection
70
-
![alt text][selection-image]
71
-
72
-
From [Wikipedia][selection-wiki]: The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
73
-
74
-
__Properties__
75
-
* Worst case performance O(n^2)
76
-
* Best case performance O(n^2)
77
-
* Average case performance O(n^2)
78
-
79
-
###### View the algorithm in [action][selection-toptal]
80
-
81
-
### Shell
82
-
![alt text][shell-image]
83
-
84
-
From [Wikipedia][shell-wiki]: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywherem considereing every nth element gives a sorted list. Such a list is said to be h-sorted. Equivanelty, it can be thought of as h intterleaved lists, each individually sorted.
85
-
86
-
__Properties__
87
-
* Worst case performance O(nlog2 2n)
88
-
* Best case performance O(n log n)
89
-
* Average case performance depends on gap sequence
90
-
91
-
###### View the algorithm in [action][shell-toptal]
92
-
93
-
###Time-Compexity Graphs
94
-
95
-
Comparing the complexity of sorting algorithms (Bubble Sort, Insertion Sort, Selection Sort)
From [Wikipedia][linear-wiki]: linear search or sequential search is a method for finding a target value within a list. It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched.
107
-
Linear search runs in at worst linear time and makes at most n comparisons, where n is the length of the list.
108
-
109
-
__Properties__
110
-
* Worst case performance O(n)
111
-
* Best case performance O(1)
112
-
* Average case performance O(n)
113
-
* Worst case space complexity O(1) iterative
114
-
115
-
### Binary
116
-
![alt text][binary-image]
117
-
118
-
From [Wikipedia][binary-wiki]: Binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until it is successful.
119
-
120
-
__Properties__
121
-
* Worst case performance O(log n)
122
-
* Best case performance O(1)
123
-
* Average case performance O(log n)
124
-
* Worst case space complexity O(1)
125
-
126
-
### Interpolation
127
-
Interpolation search is an improved version of binary search algorithm.
Even when the data is sorted, binary search does not take advantage of that to probe the position of desired data.
132
-
Position Probing in Interpolation
133
-
SearchInterpolation search search a particular item by computing the probe position. Initially probe position is the position of the middle most item of the collection.If middle item is greater than item then probe position is again calculated in the sub-array to the right of the middle item other wise item is search in sub-array to the left of the middle item. This process continues on sub-array as well until the size of subarray reduces to zero.
In cryptography, a **Caesar cipher**, also known as Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques.<br>
151
-
It is **a type of substitution cipher** in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of 3, D would be replaced by A, E would become B, and so on. <br>
152
-
The method is named after **Julius Caesar**, who used it in his private correspondence.<br>
153
-
The encryption step performed by a Caesar cipher is often incorporated as part of more complex schemes, such as the Vigenère cipher, and still has modern application in the ROT13 system. As with all single-alphabet substitution ciphers, the Caesar cipher is easily broken and in modern practice offers essentially no communication security.
We maintain a curated list of issues under the . We encourage to start working with them. Please join the gitter channel for any doubts.
0 commit comments