Array related Data Stucture using Python

Author: alaminkhan786

Array/Bubble Sort.py

@@ -0,0 +1,44 @@
+#Algorithms:
+
+# The function "bubble_sort" takes a list 'my_list' as input and performs bubble sort on it. It returns the sorted list.
+# 1.	Set variable 'n' to the length of my_list.
+# 2.	[Outer Loop – 3 to 6 steps] Iterate over each element in the range from 0 to n:
+# 3.	[Inner Loop – 4 and 5 steps] Iterate over each element in the range from 0 to n-1:
+# 4.	Check if the current element at index j is greater than the next element at index j+1.
+# 5.	If true, swap the elements at indices j and j+1 in my_list.
+# [End of Inner loop]
+# 6.	Return the sorted my_list.
+# [End of Outer loop]
+# 7.	Exit.
+
+
+
+
+#----------------------------------
+
+#Python_Code
+
+def bubble_sort(my_list):
+ n = len(my_list)
+
+ for i in range(n):
+ for j in range(n - 1):
+ if my_list[j] > my_list[j + 1]:
+ my_list[j], my_list[j + 1] = my_list[j + 1], my_list[j]
+
+ return my_list
+
+Array_len = int(input("Enter the array lenght: "))
+Array = []
+
+print("Enter the", Array_len, "element of array: ")
+
+for i in range(Array_len):
+ Array.append(int(input(f"Enter no. {i+1} element: ")))
+ i = i + 1
+
+
+print("Original Array:", Array)
+
+sorted_array = bubble_sort(Array)
+print("Sorted Array:", sorted_array)

Array/Deletion Array.py

@@ -0,0 +1,52 @@
+#Algorithms:
+
+# The function "delete index" takes a list 'my_list', and the position at which the value should be inserted 'delete_position'. It returns # a new list with removes the element at the specified position in the input list and returns a new list without that element.
+# 1. Set an empty list new_list.
+# 2. Set variables 'i' for index and 'j' the length of my_list.
+# 3. [Repeat Steps 4 and 5] While i < j
+# 4. Check If i != delete_position, add the value’s to new_list one by one.
+# 5. [Increase Counter] Set i:= i-1.
+# [End the loop]
+# 7. Return new_list.
+# 8. Exit
+
+
+
+#----------------------------------
+
+#Python_Code
+
+def delete_index(my_list, delete_position):
+ new_list = []
+ i = 0
+ j = len(my_list)
+ delete_position = delete_position - 1
+
+ while i < j:
+ if i != delete_position:
+ new_list = new_list + [my_list[i]]
+ i += 1
+
+ return new_list
+
+
+Array_len = int(input("Enter the array lenght: "))
+Array = []
+
+print("Enter the", Array_len, "element of array: ")
+
+for i in range(Array_len):
+ Array.append(int(input(f"Enter no. {i+1} element: ")))
+ i = i + 1
+
+
+k = int(input("Position: "))
+
+if 1 <= k < (len(Array) + 1):
+ print("Original Array:", Array)
+
+ Output = delete_index(Array, k)
+ print("Modified Array:", Output)
+else:
+ print("Array:", Array)
+ print("Delete position Error!")

Array/Insertion (Array).py

@@ -0,0 +1,59 @@
+#Algorithms:
+
+# The function "insert_value" takes a list 'my_list', a value to be 'inserted value', and the position at which the value should be inserted 'insert_position'. It returns a new list with the value inserted at the specified position.
+
+# 1. Set an empty list new_list.
+# 2. Set variables 'i' for index and 'j' the length of my_list.
+# 3. [Repeat Steps 4 to 6] While i <= j
+# 4. Check If i = insert_position, add the value to new_list.
+# 5. Check If i < j, add the current element of my_list to new_list.
+# 6. [Increase Counter] Set i:= i-1.
+# [End the loop]
+# 7. Return new_list.
+# 8. Exit
+
+
+
+
+#----------------------------------
+
+#Python_Code
+
+
+def insert_value(my_list, value, insert_position):
+ new_list = []
+ i = 0
+ j = len(my_list)
+ insert_position = insert_position - 1
+
+ while i <= j:
+ if i == insert_position:
+ new_list = new_list + [value]
+ if i < j:
+ new_list = new_list + [my_list[i]]
+ i += 1
+ return new_list
+
+
+Array_len = int(input("Enter the array lenght: "))
+Array = []
+
+print("Enter the", Array_len, "element of array: ")
+
+for i in range(Array_len):
+ Array.append(int(input(f"Enter no. {i+1} element: ")))
+ i = i + 1
+
+print("Original Array:", Array)
+
+item = int(input("Value: "))
+k = int(input("Position: "))
+
+if 1 <= k <= (len(Array) + 1):
+ print("Original Array:", Array)
+
+ Output = insert_value(Array, item, k)
+ print("Modified Array:", Output)
+else:
+ print("Array:", Array)
+ print("Inserted position Error!")

Array/Linear Search.py

@@ -0,0 +1,49 @@
+#Algorithms:
+
+# 1.	Set a list named 'list' with values.
+# 2.	Get user input for the search value and store it in the variable 'search'.
+# 3.	Set a variable 'found' to False. (Because, Program hasn’t started yet.)
+# 4.	Initialize a variable 'i' to 0 for indexing.
+# 5.	[Use FOR loop] For each 'item' in 'my_list':
+# a.	Check if 'search' == 'item'.
+# b.	If equal, set 'found' to True, break out of the loop.
+# c.	Set i:= i+1.
+# [End the loop]
+# 6.	Check if 'found' is True:
+# a.	Print the search value, ‘position’, and a message indicating it is found.
+# 7.	If 'found' is False:
+# a.	Print a message indicating the search value is not found.
+# 8.	Exit.
+
+
+
+
+#----------------------------------
+
+#Python_Code
+
+list_len = int(input("Enter the list lenght: "))
+list = []
+
+print("Enter the", list_len, "element of list...")
+
+for i in range(list_len):
+ list.append(input(f"Enter no. {i+1} element: "))
+ i = i + 1
+
+print("Original list:", list)
+
+
+search = input("Enter your Search value: ")
+found = False
+i = 0
+for item in list:
+ if search == item:
+ found = True
+ break
+ i += 1
+
+if found == True:
+ print(search, "is found and ", search, "position", i + 1)
+else:
+ print(search, "is not found")

README.md

@@ -0,0 +1 @@
+# DSA-Python