Index
- built_in_functions
 - Python abs()
 - Python all()
 - Python any()
 - Python ascii()
 - Python bin()
 - Python bool()
 - Python bytearray()
 - Python bytes()
 - Python callable()
 - Python chr()
 - Python classmethod()
 - Python compile()
 - Python complex()
 - Python delattr()
 - Python dict()
 - Python dir()
 - Python divmod()
 - Python enumerate()
 - Python eval()
 - Python exec()
 - Python filter()
 - Python float()
 - Python format()
 - Python frozenset()
 - Python getattr()
 - Python globals()
 - Python hasattr()
 - Python hash()
 - Python help()
 - Python hex()
 - Python id()
 - Python input()
 - Python int()
 - Python isinstance()
 - Python issubclass()
 - Python iter()
 - Python len()
 - Python list()
 - Python locals()
 - Python map()
 - Python max()
 - Python memoryview()
 - Python min()
 - Python next()
 - Python object()
 - Python oct()
 - Python open()
 - Python ord()
 - Python pow()
 - Python print()
 - Python property()
 - Python range()
 - Python repr()
 - Python reversed()
 - Python round()
 - Python set()
 - Python setattr()
 - Python slice()
 - Python sorted()
 - Python staticmethod()
 - Python str()
 - Python sum()
 - Python super()
 - Python tuple() Function
 - Python type()
 - Python vars()
 - Python zip()
 - Python __import__()
 - python1compute
 - Python Program to Find Hash of File
 - Python Program to Find the Size (Resolution) of a Image
 - Python Program to Merge Mails
 - Python Program to Count the Number of Each Vowel - Source Code: Using a list and a dictionary comprehension
 - Python Program to Count the Number of Each Vowel - Source Code: Using Dictionary
 - Python Program to Illustrate Different Set Operations
 - Python Program to Sort Words in Alphabetic Order
 - Python Program to Remove Punctuations From a String
 - Python Program to Multiply Two Matrices - Matrix Multiplication Using Nested List Comprehension
 - Python Program to Multiply Two Matrices - Source Code: Matrix Multiplication using Nested Loop
 - Python Program to Transpose a Matrix - Matrix Transpose using Nested List Comprehension
 - Python Program to Transpose a Matrix - Matrix Transpose using Nested Loop
 - Python Program to Add Two Matrices - Source Code: Matrix Addition using Nested List Comprehension
 - Python Program to Check Whether a String is Palindrome or Not
 - Python Program to Add Two Matrices - Source code: Matrix Addition using Nested Loop
 - Python Program to Convert Decimal to Binary Using Recursion
 - Python Program to Find Factorial of Number Using Recursion
 - Python Program to Find Sum of Natural Numbers Using Recursion
 - Python Program to Display Fibonacci Sequence Using Recursion
 - Python Program to Display Calendar
 - Python Program to Shuffle Deck of Cards
 - Python Program to Make a Simple Calculator
 - Python Program to Find Factors of Number
 - Python Program to Find LCM - Without using GCD function
 - Python Program to Find HCF or GCD - Source Code: Using Euclidean Algorithm
 - Python Program to Find LCM - Source Code: Using GCD function
 - Python Program to Find HCF or GCD - Source Code: Using Loops
 - Python Program to Find ASCII Value of Character
 - Python Program to Convert Decimal to Binary, Octal and Hexadecimal
 - Python Program to Find Numbers Divisible by Another Number
 - Python Program To Display Powers of 2 Using Anonymous Function
 - Python Program to Find the Sum of Natural Numbers
 - Python Program to Find Armstrong Number in an Interval
 - Python Program to Check Armstrong Number - Source Code: Check Armstrong number of n digits
 - Python Program to Check Armstrong Number - Source Code: Check Armstrong number (for 3 digits)
 - Python Program to Print the Fibonacci sequence
 - Python Program to Display the multiplication Table
 - Python Program to Find the Factorial of a Number
 - Python Program to Print all Prime Numbers in an Interval
 - Python Program to Find the Largest Among Three Numbers
 - Python Program to Check Prime Number
 - Python Program to Check Leap Year
 - Python Program to Check if a Number is Odd or Even
 - Python Program to Check if a Number is Positive, Negative or 0 Source Code: Using Nested if
 - Python Program to Check if a Number is Positive, Negative or 0 Source Code: Using if...elif...else
 - Python Program to Convert Celsius To Fahrenheit
 - Python Program to Generate a Random Number
 - Python Program to Convert Kilometers to Miles
 - Python Program to Swap Two Variables Source Code: Without Using Temporary Variable
 - Python Program to Swap Two Variables Source Code: Using temporary variable
 - Python Program to Solve Quadratic Equation
 - Python Program to Calculate the Area of a Triangle
 - Python Program to Find the Square Root Source code: For real or complex numbers using cmath module
 - Python Program to Find the Square Root Source Code: For positive numbers using exponent **
 - Python Program to Add Two Numbers By One Line
 - Python Program to Add Two Numbers Source Code: Add Two Numbers Provided by The User
 - Python Program to Add Two Numbers
 - Python Program to Print Hello world!
 - python2based
 
sorting_in_python
import random
def csort(array):
for i in range(len(array)):
indxMin = i
for j in range(i+1, len(array)):
if array[j] < array[indxMin]:
indxMin = j
tmp = array[indxMin]
array[indxMin] = array[i]
array[i] = tmp
return array
def isort(array):
for i in range(len(array)):
v = array[i]
j = i
while (array[j-1] > v) and (j > 0):
array[j] = array[j-1]
j = j - 1
array[j] = v
# print (array)
return array
def bubble_sort(array):
a = array
for i in range(len(a),0,-1):
for j in range(1, i):
if a[j-1] > a[j]:
tmp = a[j-1]
a[j-1] = a[j]
a[j] = tmp
# print (a)
return a
def shell_sort(array):
t = int(len(array)/2)
while t > 0:
for i in range(len(array)-t):
j = i
while j >= 0 and array[j] > array[j+t]:
array[j], array[j+t] = array[j+t], array[j]
j -= 1
t = int(t/2)
def quicksort(nums):
if len(nums) <= 1:
return nums
else:
q = random.choice(nums)
s_nums = []
m_nums = []
e_nums = []
for n in nums:
if n < q:
s_nums.append(n)
elif n > q:
m_nums.append(n)
else:
e_nums.append(n)
return quicksort(s_nums) + e_nums + quicksort(m_nums)
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Choice sort - csort()")
print(l)
csort(l)
print(l)
print("-------------------------------------------------")
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Insert sort - isort()")
print(l)
isort(l)
print(l)
print("-------------------------------------------------")
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Buble sort - bubble_sort()")
print(l)
bubble_sort(l)
print(l)
print("-------------------------------------------------")
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Shell's sort - shell_sort()")
print(l)
shell_sort(l)
print(l)
print("-------------------------------------------------")
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Python sorted - sorted()")
print(l)
array = sorted(l)
print(array)
print("-------------------------------------------------")
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Quick Hoar's Sort - quicksort()")
print(l)
array = quicksort(l)
print(array)
def csort(array):
for i in range(len(array)):
indxMin = i
for j in range(i+1, len(array)):
if array[j] < array[indxMin]:
indxMin = j
tmp = array[indxMin]
array[indxMin] = array[i]
array[i] = tmp
return array
def isort(array):
for i in range(len(array)):
v = array[i]
j = i
while (array[j-1] > v) and (j > 0):
array[j] = array[j-1]
j = j - 1
array[j] = v
# print (array)
return array
def bubble_sort(array):
a = array
for i in range(len(a),0,-1):
for j in range(1, i):
if a[j-1] > a[j]:
tmp = a[j-1]
a[j-1] = a[j]
a[j] = tmp
# print (a)
return a
def shell_sort(array):
t = int(len(array)/2)
while t > 0:
for i in range(len(array)-t):
j = i
while j >= 0 and array[j] > array[j+t]:
array[j], array[j+t] = array[j+t], array[j]
j -= 1
t = int(t/2)
def quicksort(nums):
if len(nums) <= 1:
return nums
else:
q = random.choice(nums)
s_nums = []
m_nums = []
e_nums = []
for n in nums:
if n < q:
s_nums.append(n)
elif n > q:
m_nums.append(n)
else:
e_nums.append(n)
return quicksort(s_nums) + e_nums + quicksort(m_nums)
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Choice sort - csort()")
print(l)
csort(l)
print(l)
print("-------------------------------------------------")
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Insert sort - isort()")
print(l)
isort(l)
print(l)
print("-------------------------------------------------")
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Buble sort - bubble_sort()")
print(l)
bubble_sort(l)
print(l)
print("-------------------------------------------------")
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Shell's sort - shell_sort()")
print(l)
shell_sort(l)
print(l)
print("-------------------------------------------------")
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Python sorted - sorted()")
print(l)
array = sorted(l)
print(array)
print("-------------------------------------------------")
l = [81,923,4789,67891,36031,7632692,376,92,113,76,902,357,809,3,8]
print("Quick Hoar's Sort - quicksort()")
print(l)
array = quicksort(l)
print(array)