Solve Problems by Coding Solutions - A Complete solution for python programming
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();