Solve Problems by Coding Solutions - A Complete solution for python programming
def cocktailSort(a):
n = len(a)
swapped = True
start = 0
end = n-1
while (swapped==True):
swapped = False
for i in range (start, end):
if (a[i] > a[i+1]) :
a[i], a[i+1]= a[i+1], a[i]
swapped=True
if (swapped==False):
break
swapped = False
end = end-1
for i in range(end-1, start-1,-1):
if (a[i] > a[i+1]):
a[i], a[i+1] = a[i+1], a[i]
swapped = True
start = start+1
a = [5, 1, 4, 2, 8, 0, 2 ,6,7]
cocktailSort(a)
print("Sorted array is:")
for i in range(len(a)):
print ("%d" %a[i]),
def gnomeSort( arr, n):
index = 0
while index < n:
if index == 0:
index = index + 1
if arr[index] >= arr[index - 1]:
index = index + 1
else:
arr[index], arr[index-1] = arr[index-1], arr[index]
index = index - 1
return arr
arr = [ 34, 2, 10, -9]
n = len(arr)
arr = gnomeSort(arr, n)
print ("Sorted seqquence after applying Gnome Sort :")
for i in arr:
print (i)
class Node:
def __init__(self,data):
self.data = data;
self.next = None;
class CreateList:
def __init__(self):
self.head = Node(None);
self.tail = Node(None);
self.head.next = self.tail;
self.tail.next = self.head;
def add(self,data):
newNode = Node(data);
if self.head.data is None:
self.head = newNode;
self.tail = newNode;
newNode.next = self.head;
else:
self.tail.next = newNode;
self.tail = newNode;
self.tail.next = self.head;
def minNode(self):
current = self.head;
minimum = self.head.data;
if(self.head == None):
print("List is empty");
else:
while(True):
if(minimum > current.data):
minimum = current.data;
current= current.next;
if(current == self.head):
break;
print("Minimum value node in the list: "+ str(minimum));
def maxNode(self):
current = self.head;
maximum = self.head.data;
if(self.head == None):
print("List is empty");
else:
while(True):
if(maximum < current.data):
maximum = current.data;
current= current.next;
if(current == self.head):
break;
print("Maximum value node in the list: "+ str(maximum));
class CircularLinkedList:
cl = CreateList();
cl.add(5);
cl.add(20);
cl.add(10);
cl.add(1);
cl.minNode();
cl.maxNode();
sample_list = [["Hi", "python"], ["welcome", "for"], ["to","engineers"]]
print("The original list : " + str(sample_list))
res = []
N = 0
while N != len(sample_list):
temp = ''
for idx in sample_list:
try: temp = temp + idx[N]
except IndexError: pass
res.append(temp)
N = N + 1
res = [ele for ele in res if ele]
print("List after column Concatenation : " + str(res))
import datetime
import calendar
def day_occur_time(year):
days = [ "Monday", "Tuesday", "Wednesday",
"Thursday", "Friday", "Saturday",
"Sunday" ]
L = [52 for i in range(7)]
pos = -1
day = datetime.datetime(year, month = 1, day = 1).strftime("%A")
for i in range(7):
if day == days[i]:
pos = i
if calendar.isleap(year):
L[pos] += 1
L[(pos+1)%7] += 1
else:
L[pos] += 1
for i in range(7):
print(days[i], L[i])
year = 2020
day_occur_time(year)