GitHub - Krushna-Prasad-Sahoo/Sorting-Python

Bubble Sort:is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.
Insertion Sort
Heap Sort
Maximum of two numbers in Python
Python Program for simple interest
Python Program for factorial of a number
Django and Flask are most Popular Python Framework
Python use for ML Studies Also
python widely use programming Language

Name		Name	Last commit message	Last commit date
Latest commit History 65 Commits
Bogo sort.py		Bogo sort.py
Bubble-Sort		Bubble-Sort
BubbleSort.py		BubbleSort.py
Heap Sort		Heap Sort
Insertion-sort		Insertion-sort
Kadanes_Algorithm.py		Kadanes_Algorithm.py
Maximum of two number in Python		Maximum of two number in Python
Maximum of two numbers in Python		Maximum of two numbers in Python
Merge Sort		Merge Sort
Merge sort		Merge sort
MergeSort.py		MergeSort.py
Python Program for compound interest		Python Program for compound interest
Python Program for factorial of a number		Python Program for factorial of a number
Python Program for simple interest		Python Program for simple interest
QuickSort.py		QuickSort.py
README.md		README.md
RadixSort.py		RadixSort.py
Selectionsort.py		Selectionsort.py
Sort numeric strings in a list in Python by Naive Methodby		Sort numeric strings in a list in Python by Naive Methodby
add two number		add two number
area.py		area.py
bullcowgame.py		bullcowgame.py
c.py		c.py
calc.py		calc.py
checkconnection.py		checkconnection.py
client-chat.py		client-chat.py
multiplication.py		multiplication.py
solve quadratic		solve quadratic
sum of even number		sum of even number
sum of oddno.py		sum of oddno.py
swap in python		swap in python

Provide feedback