[go: up one dir, main page]
Scribd
Upload
48 views8 pages

Nishant Python

The document describes experiments implementing different sorting algorithms in Python - binary search, selection sort, insertion sort, merge sort. It includes the code to implement each algorithm and test it on sample data. Each experiment prints the aim, source code to implement the algorithm, example output on sample data, and the name of the student.

Uploaded by

grindmotherfckr
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
48 views8 pages

Nishant Python

The document describes experiments implementing different sorting algorithms in Python - binary search, selection sort, insertion sort, merge sort. It includes the code to implement each algorithm and test it on sample data. Each experiment prints the aim, source code to implement the algorithm, example output on sample data, and the name of the student.

Uploaded by

grindmotherfckr
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

EXPERIMENT-9

AIM-WRITE A PYTHON PROGRAM TO IMPLEMENT BINARY


SEARCH.
SOURCE CODE

def binary_search(arr, target):


low = 0
high = len(arr) - 1

while low <= high:


mid = (low + high)
guess = arr[mid]

if guess == target:
return mid
elif guess < target:
low = mid + 1
else:
high = mid - 1

return -1 # Target element not found

# Example usage:
my_list = [2, 4, 7, 10, 14, 20, 22]
target_number = 14

result = binary_search(my_list, target_number)


if result != -1:
print(f"Target number {target_number} found at position {result+1}")
else:
print("Target number not found in the list.")
print('NISHANT SHARMA')

OUTPUT
EXPERIMENT-10
AIM-WRITE A PYTHON PROGRAM TO IMPLEMENT SELECTION
SORT.
SOURCE CODE-
def selection_sort(arr):
n = len(arr)

for i in range(n-1):
min_index = i
for j in range(i+1, n):
if arr[j] < arr[min_index]:
min_index = j
arr[i], arr[min_index] = arr[min_index], arr[i]
my_list = [64, 25, 12, 22, 11]
selection_sort(my_list)
print("Sorted list:", my_list)
print('NISHANT SHARMA')

OUTPUT-
EXPERIMENT-11
AIM-WRITE A PYTHON PROGRAM INSERTION SORT
SOURCE CODE-
def insertion_sort(arr):
n = len(arr)
for i in range(1, n):
key = arr[i]
j=i-1
while j >= 0 and arr[j] > key:
arr[j + 1] = arr[j]
j -= 1
arr[j + 1] = key
my_list = [64, 25, 12, 22, 11]
insertion_sort(my_list)
print("Sorted list:", my_list)
print('NISHANT SHARMA')

OUTPUT-
EXPERIMENT-12
AIM-WRITE A PYTHON PROGRAM TO IMPLEMENT MERGE
SORT.
SOURCE CODE-
def merge_sort(arr):
if len(arr) <= 1:
return arr
mid = len(arr) // 2
left_half = arr[:mid]
right_half = arr[mid:]
left_half = merge_sort(left_half)
right_half = merge_sort(right_half)
return merge(left_half, right_half)
def merge(left, right):
merged = []
i=j=0
while i < len(left) and j < len(right):
if left[i] <= right[j]:
merged.append(left[i])
i += 1
else:
merged.append(right[j])
j += 1
merged.extend(left[i:])
merged.extend(right[j:])
return merged
my_list = [64, 25, 12, 22, 11]
sorted_list = merge_sort(my_list)
print("Sorted list:", sorted_list)
print('NISHANT SHARMA')

OUTPUT-
EXPERIMENT-13
AIM-WRITE A PYTHON PROGRAM TO FIND PRIME NUMBER.
SOURCE CODE-
def is_prime(num):
if num < 2:
return False
for i in range(2, int(num**0.5) + 1):
if num % i == 0:
return False
return True
def generate_primes(start, end):
primes = []
for num in range(start, end + 1):
if is_prime(num):
primes.append(num)
return primes
start_range = 1
end_range = 50
prime_numbers = generate_primes(start_range, end_range)
print("Prime numbers from", start_range, "to", end_range, "are:", prime_numbers)
print('NISHANT SHARMA')

OUTPUT-

You might also like