├── LICENSE ├── binarysearch.py ├── bubblesort.py ├── circularlinkedlistdeletion.py ├── circularlinkedlistinsertion.py ├── doublelinkedlistdeletion.py ├── doublelinkedlistinsertion.py ├── heapsort.py ├── insertionsort.py ├── linearsearch.py ├── mergesort.py ├── quicksort.py ├── selectionsort.py ├── singlelinkedlistdeletion.py ├── singlelinkedlistinsertion.py └── singlelinkedlistreversal.py /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "[]" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright [yyyy] [name of copyright owner] 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | -------------------------------------------------------------------------------- /binarysearch.py: -------------------------------------------------------------------------------- 1 | def binary_search(arr, x): 2 | low = 0 3 | high = len(arr) - 1 4 | while low <= high: 5 | mid = (low + high) // 2 6 | if arr[mid] == x: 7 | return mid 8 | elif arr[mid] < x: 9 | low = mid + 1 10 | else: 11 | high = mid - 1 12 | return -1 13 | 14 | arr = [2, 4, 6, 8, 10] 15 | x = 6 16 | result = binary_search(arr, x) 17 | 18 | if result != -1: 19 | print("Element found at index", result) 20 | else: 21 | print("Element not found") 22 | -------------------------------------------------------------------------------- /bubblesort.py: -------------------------------------------------------------------------------- 1 | def bubble_sort(arr): 2 | n = len(arr) 3 | for i in range(n): 4 | for j in range(0, n-i-1): 5 | if arr[j] > arr[j+1]: 6 | arr[j], arr[j+1] = arr[j+1], arr[j] 7 | 8 | arr = [64, 34, 25, 12, 22, 11, 90] 9 | bubble_sort(arr) 10 | print("Sorted array is:", arr) 11 | -------------------------------------------------------------------------------- /circularlinkedlistdeletion.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.next = None 5 | 6 | class CircularLinkedList: 7 | def __init__(self): 8 | self.head = None 9 | 10 | def insert_at_end(self, data): 11 | new_node = Node(data) 12 | if self.head is None: 13 | self.head = new_node 14 | new_node.next = self.head 15 | return 16 | last = self.head 17 | while last.next != self.head: 18 | last = last.next 19 | last.next = new_node 20 | new_node.next = self.head 21 | 22 | def delete_node(self, key): 23 | if self.head is None: 24 | return 25 | last = self.head 26 | if self.head.data == key: 27 | while last.next != self.head: 28 | last = last.next 29 | if self.head == self.head.next: 30 | self.head = None 31 | else: 32 | last.next = self.head.next 33 | self.head = last.next 34 | return 35 | prev = None 36 | temp = self.head 37 | while temp.next != self.head: 38 | if temp.data == key: 39 | prev.next = temp.next 40 | return 41 | prev = temp 42 | temp = temp.next 43 | 44 | def print_list(self): 45 | current = self.head 46 | if self.head is not None: 47 | while True: 48 | print(current.data, end=" ") 49 | current = current.next 50 | if current == self.head: 51 | break 52 | 53 | cll = CircularLinkedList() 54 | cll.insert_at_end(1) 55 | cll.insert_at_end(2) 56 | cll.insert_at_end(3) 57 | cll.delete_node(2) 58 | cll.print_list() 59 | -------------------------------------------------------------------------------- /circularlinkedlistinsertion.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.next = None 5 | 6 | class CircularLinkedList: 7 | def __init__(self): 8 | self.head = None 9 | 10 | def insert_at_end(self, data): 11 | new_node = Node(data) 12 | if self.head is None: 13 | self.head = new_node 14 | new_node.next = self.head 15 | return 16 | last = self.head 17 | while last.next != self.head: 18 | last = last.next 19 | last.next = new_node 20 | new_node.next = self.head 21 | 22 | def print_list(self): 23 | current = self.head 24 | if self.head is not None: 25 | while True: 26 | print(current.data, end=" ") 27 | current = current.next 28 | if current == self.head: 29 | break 30 | 31 | cll = CircularLinkedList() 32 | cll.insert_at_end(1) 33 | cll.insert_at_end(2) 34 | cll.insert_at_end(3) 35 | cll.print_list() 36 | -------------------------------------------------------------------------------- /doublelinkedlistdeletion.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.prev = None 5 | self.next = None 6 | 7 | class DoublyLinkedList: 8 | def __init__(self): 9 | self.head = None 10 | 11 | def insert_at_end(self, data): 12 | new_node = Node(data) 13 | if self.head is None: 14 | self.head = new_node 15 | return 16 | last = self.head 17 | while last.next: 18 | last = last.next 19 | last.next = new_node 20 | new_node.prev = last 21 | 22 | def delete_node(self, key): 23 | temp = self.head 24 | if temp is not None: 25 | if temp.data == key: 26 | self.head = temp.next 27 | if self.head: 28 | self.head.prev = None 29 | temp = None 30 | return 31 | while temp is not None: 32 | if temp.data == key: 33 | break 34 | temp = temp.next 35 | if temp is None: 36 | return 37 | if temp.next is not None: 38 | temp.next.prev = temp.prev 39 | if temp.prev is not None: 40 | temp.prev.next = temp.next 41 | temp = None 42 | 43 | def print_list(self): 44 | current = self.head 45 | while current: 46 | print(current.data, end=" ") 47 | current = current.next 48 | 49 | dll = DoublyLinkedList() 50 | dll.insert_at_end(1) 51 | dll.insert_at_end(2) 52 | dll.insert_at_end(3) 53 | dll.delete_node(2) 54 | dll.print_list() 55 | -------------------------------------------------------------------------------- /doublelinkedlistinsertion.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.prev = None 5 | self.next = None 6 | 7 | class DoublyLinkedList: 8 | def __init__(self): 9 | self.head = None 10 | 11 | def insert_at_end(self, data): 12 | new_node = Node(data) 13 | if self.head is None: 14 | self.head = new_node 15 | return 16 | last = self.head 17 | while last.next: 18 | last = last.next 19 | last.next = new_node 20 | new_node.prev = last 21 | 22 | def print_list(self): 23 | current = self.head 24 | while current: 25 | print(current.data, end=" ") 26 | current = current.next 27 | 28 | dll = DoublyLinkedList() 29 | dll.insert_at_end(1) 30 | dll.insert_at_end(2) 31 | dll.insert_at_end(3) 32 | dll.print_list() 33 | -------------------------------------------------------------------------------- /heapsort.py: -------------------------------------------------------------------------------- 1 | def heapify(arr, n, i): 2 | largest = i 3 | l = 2 * i + 1 4 | r = 2 * i + 2 5 | if l < n and arr[l] > arr[largest]: 6 | largest = l 7 | if r < n and arr[r] > arr[largest]: 8 | largest = r 9 | if largest != i: 10 | arr[i], arr[largest] = arr[largest], arr[i] 11 | heapify(arr, n, largest) 12 | 13 | def heap_sort(arr): 14 | n = len(arr) 15 | for i in range(n // 2 - 1, -1, -1): 16 | heapify(arr, n, i) 17 | for i in range(n-1, 0, -1): 18 | arr[i], arr[0] = arr[0], arr[i] 19 | heapify(arr, i, 0) 20 | 21 | arr = [12, 11, 13, 5, 6, 7] 22 | heap_sort(arr) 23 | print("Sorted array is:", arr) 24 | -------------------------------------------------------------------------------- /insertionsort.py: -------------------------------------------------------------------------------- 1 | def insertion_sort(arr): 2 | for i in range(1, len(arr)): 3 | key = arr[i] 4 | j = i-1 5 | while j >= 0 and key < arr[j]: 6 | arr[j + 1] = arr[j] 7 | j -= 1 8 | arr[j + 1] = key 9 | 10 | arr = [12, 11, 13, 5, 6] 11 | insertion_sort(arr) 12 | print("Sorted array is:", arr) 13 | -------------------------------------------------------------------------------- /linearsearch.py: -------------------------------------------------------------------------------- 1 | def linear_search(arr, x): 2 | for i in range(len(arr)): 3 | if arr[i] == x: 4 | return i 5 | return -1 6 | 7 | arr = [2, 4, 6, 8, 10] 8 | x = 6 9 | result = linear_search(arr, x) 10 | 11 | if result != -1: 12 | print("Element found at index", result) 13 | else: 14 | print("Element not found") 15 | -------------------------------------------------------------------------------- /mergesort.py: -------------------------------------------------------------------------------- 1 | def merge_sort(arr): 2 | if len(arr) > 1: 3 | mid = len(arr) // 2 4 | L = arr[:mid] 5 | R = arr[mid:] 6 | 7 | merge_sort(L) 8 | merge_sort(R) 9 | 10 | i = j = k = 0 11 | while i < len(L) and j < len(R): 12 | if L[i] < R[j]: 13 | arr[k] = L[i] 14 | i += 1 15 | else: 16 | arr[k] = R[j] 17 | j += 1 18 | k += 1 19 | while i < len(L): 20 | arr[k] = L[i] 21 | i += 1 22 | k += 1 23 | while j < len(R): 24 | arr[k] = R[j] 25 | j += 1 26 | k += 1 27 | 28 | arr = [12, 11, 13, 5, 6, 7] 29 | merge_sort(arr) 30 | print("Sorted array is:", arr) 31 | -------------------------------------------------------------------------------- /quicksort.py: -------------------------------------------------------------------------------- 1 | def partition(arr, low, high): 2 | pivot = arr[high] 3 | i = low - 1 4 | for j in range(low, high): 5 | if arr[j] <= pivot: 6 | i += 1 7 | arr[i], arr[j] = arr[j], arr[i] 8 | arr[i+1], arr[high] = arr[high], arr[i+1] 9 | return i+1 10 | 11 | def quick_sort(arr, low, high): 12 | if low < high: 13 | pi = partition(arr, low, high) 14 | quick_sort(arr, low, pi-1) 15 | quick_sort(arr, pi+1, high) 16 | 17 | arr = [10, 7, 8, 9, 1, 5] 18 | quick_sort(arr, 0, len(arr)-1) 19 | print("Sorted array is:", arr) 20 | -------------------------------------------------------------------------------- /selectionsort.py: -------------------------------------------------------------------------------- 1 | def selection_sort(arr): 2 | for i in range(len(arr)): 3 | min_idx = i 4 | for j in range(i+1, len(arr)): 5 | if arr[j] < arr[min_idx]: 6 | min_idx = j 7 | arr[i], arr[min_idx] = arr[min_idx], arr[i] 8 | 9 | arr = [64, 25, 12, 22, 11] 10 | selection_sort(arr) 11 | print("Sorted array is:", arr) 12 | -------------------------------------------------------------------------------- /singlelinkedlistdeletion.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.next = None 5 | 6 | class LinkedList: 7 | def __init__(self): 8 | self.head = None 9 | 10 | def insert_at_end(self, data): 11 | new_node = Node(data) 12 | if self.head is None: 13 | self.head = new_node 14 | return 15 | last = self.head 16 | while last.next: 17 | last = last.next 18 | last.next = new_node 19 | 20 | def delete_node(self, key): 21 | temp = self.head 22 | if temp is not None: 23 | if temp.data == key: 24 | self.head = temp.next 25 | temp = None 26 | return 27 | while temp is not None: 28 | if temp.data == key: 29 | break 30 | prev = temp 31 | temp = temp.next 32 | if temp is None: 33 | return 34 | prev.next = temp.next 35 | temp = None 36 | 37 | def print_list(self): 38 | current = self.head 39 | while current: 40 | print(current.data, end=" ") 41 | current = current.next 42 | 43 | ll = LinkedList() 44 | ll.insert_at_end(1) 45 | ll.insert_at_end(2) 46 | ll.insert_at_end(3) 47 | ll.delete_node(2) 48 | ll.print_list() 49 | -------------------------------------------------------------------------------- /singlelinkedlistinsertion.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.next = None 5 | 6 | class LinkedList: 7 | def __init__(self): 8 | self.head = None 9 | 10 | def insert_at_end(self, data): 11 | new_node = Node(data) 12 | if self.head is None: 13 | self.head = new_node 14 | return 15 | last = self.head 16 | while last.next: 17 | last = last.next 18 | last.next = new_node 19 | 20 | def print_list(self): 21 | current = self.head 22 | while current: 23 | print(current.data, end=" ") 24 | current = current.next 25 | 26 | ll = LinkedList() 27 | ll.insert_at_end(1) 28 | ll.insert_at_end(2) 29 | ll.insert_at_end(3) 30 | ll.print_list() 31 | -------------------------------------------------------------------------------- /singlelinkedlistreversal.py: -------------------------------------------------------------------------------- 1 | class Node: 2 | def __init__(self, data): 3 | self.data = data 4 | self.next = None 5 | 6 | class LinkedList: 7 | def __init__(self): 8 | self.head = None 9 | 10 | def insert_at_end(self, data): 11 | new_node = Node(data) 12 | if self.head is None: 13 | self.head = new_node 14 | return 15 | last = self.head 16 | while last.next: 17 | last = last.next 18 | last.next = new_node 19 | 20 | def reverse(self): 21 | prev = None 22 | current = self.head 23 | while current is not None: 24 | next = current.next 25 | current.next = prev 26 | prev = current 27 | current = next 28 | self.head = prev 29 | 30 | def print_list(self): 31 | current = self.head 32 | while current: 33 | print(current.data, end=" ") 34 | current = current.next 35 | 36 | ll = LinkedList() 37 | ll.insert_at_end(1) 38 | ll.insert_at_end(2) 39 | ll.insert_at_end(3) 40 | ll.reverse() 41 | ll.print_list() 42 | --------------------------------------------------------------------------------