Skip to content

Commit bac031e

Browse files
committed
Python Programs
1 parent a58453a commit bac031e

11 files changed

+90
-0
lines changed

Programs/P21_GuessTheNumber.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
#Author: OMKAR PATHAK
12
#This program guesses the randomnly generated number
23

34

Programs/P22_SequentialSearch.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
#Author: OMKAR PATHAK
12
#This program is an example for sequential search
23

34
def sequentialSearch(target, List):

Programs/P23_BinarySearch.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
#Author: OMKAR PATHAK
12
#This programs give an example of binary search algorithm
23

34
def binarySearch(target, List):

Programs/P24_SelectionSort.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
#Author: OMKAR PATHAK
12
#This program shows an example of selection sort
23

34
#Selection sort iterates all the elements and if the smallest element in the list is found then that number

Programs/P25_BubbleSort.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
#Author: OMKAR PATHAK
12
#This program shows an example of bubble sort using Python
23

34
# Bubblesort is an elementary sorting algorithm. The idea is to

Programs/P26_Insertion_Sort.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
#Author: OMKAR PATHAK
12
#This program shows an example of insertion sort using Python
23

34
# Insertion sort is good for collections that are very small

Programs/P27_MergeSort.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
#Author: OMKAR PATHAK
12
#This program gives an example of Merge sort
23

34
# Merge sort is a divide and conquer algorithm. In the divide and

Programs/P28_QuickSort.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
#Author: OMKAR PATHAK
12
#This program illustrates an example of quick sort
23

34
# Quicksort works by selecting an element called a pivot and splitting

Programs/P29_ArgumentParser.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
#Author: OMKAR PATHAK
12
#In this example w will see the example for Python argument parser
23

34
import argparse

Programs/P30_Array.py

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
#Author: OMKAR PATHAK
12
#This example illustrates how an array can be implemened using Python
23

34
class Array(object):

0 commit comments

Comments
 (0)