Skip to main content

Python - Sort a list in ascending and descending order without using in-built function and in the most efficient way

This piece of logic goes through a list how our eyes would go though it to sort it in ascending and descending order.
class Sorta:

def __init__(self, a):

self.a = a
def sortascend(self):

print("Ascending Before: {}".format(self.a))

index = 1 # to track upto what have we checked
while index < len(self.a): #while runs till index reaches the end of array

if self.a[index] < self.a[index-1]: # if not ascending makes ascending
temp = self.a[index]
self.a[index] = self.a[index-1]
self.a[index-1] = temp
bool1 = True
index2 = index
while bool1: # runs backwards till descending pairs are encountered
index2 -= 1
if self.a[index2] < self.a[index2-1]: # if not ascending makes ascending
temp = self.a[index2]
self.a[index2] = self.a[index2-1]
self.a[index2-1] = temp
else: # else gets out of while loop
bool1 = False
index += 1 # moves to next index

print("Ascending After: {}".format(self.a))

def sortdescend(self):

print("Descending Before: {}".format(self.a))

index = 1 # to track upto what have we checked
while index < len(self.a): #while runs till index reaches the end of array

if self.a[index] > self.a[index-1]: # if not ascending makes ascending
temp = self.a[index]
self.a[index] = self.a[index-1]
self.a[index-1] = temp
bool1 = True
index2 = index
while bool1: # runs backwards till descending pairs are encountered
index2 -= 1
if self.a[index2] > self.a[index2-1] and index2 > 0: # if not ascending makes ascending
temp = self.a[index2]
self.a[index2] = self.a[index2-1]
self.a[index2-1] = temp
else: # else gets out of while loop
bool1 = False
index += 1 # moves to next index

print("Descending After: {}".format(self.a))

a = [1,4,8,3,5,2,4,2,7,6,9,5,7]
obj = Sorta(a)
obj.sortascend()
obj.sortdescend()
OUTPUT
Ascending Before: [1, 4, 8, 3, 5, 2, 4, 2, 7, 6, 9, 5, 7]
Ascending After: [1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 9]
Descending Before: [1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 9]
Descending After: [9, 8, 7, 7, 6, 5, 5, 4, 4, 3, 2, 2, 1]

Comments

Popular posts from this blog

Python - Mathematical Functions - Hexadecimal, Binary, Exponential, Absolute, Round

🐍 Some mathematical functions are in-built in python. Here are some of them. Convert Decimal to Hexadecimal hex(246) Output: '0xf6' hex(512) Output: '0x200' 0x is prefix to all hexadecimal numbers in output. The number after 0x is the hexadecimal value. Convert Decimal to Binary bin(1234) Output: '0b10011010010' bin(246) Output: '0b11110110' bin(512) Output: '0b1000000000' Exponential Function pow() function is similar to num1**num2, but it comes useful when you want to execute (num1**num2)%num3. Passing three arguments to pow(), does this. pow(3,4) Output: 81 This works just like 3**4 pow(3,4,5) Output: 1 But this, works equivalent to (3**4)%5. Either of the two ways can be used. At this point I feel (3**4)%5 is better, as anybody reading the code will understand what is being done immediately. While with pow(2,3,4), the person may have to refer to documentation to understand how this function works. Absolute Value The function abs() is used ...

Two Ways of rendering in React Examples

Two Ways of rendering in React Examples 1 - Render twice HTML < div id = "p1" ></ div > < div id = "p2" ></ div > CSS . person { display : inline - block ; margin : 10px ; border : 1px solid # eee ; box - shadow : 0 2px 2px # ccc ; } JAVASCRIPT (Babel) function Person ( props ) { return ( < div className = ' person "> < h1 >{ props . name }</ h1 > < p > Age :{ props . age }</ p > </ div > ); } ReactDOM . render (< Person name = "VK" age = "29" />, document . querySselector ( '#p1' )); ReactDOM . render (< Person name = "HK" age = "28" />, document . querySselector ( '#p2' )); 2 Render all at once HTML < div id = "app" ></ div > CSS . person { display : inline - block ; margin : 1...

Binary Tree Traversal in Python - In Order, Pre Order, Post Order

Binary Tree Traversal in Python - In Order, Pre Order, Post Order Run the code here to see output:  https://repl.it/@VinitKhandelwal/iterative-traversal-of-binary-tree # Node Class to Create Object of Nodes class Node (): def __init__ ( self , value , left= None , right= None ): self .value = value self .left = left self .right = right # Creation of a Binary Tree class BinaryTree (): def __init__ ( self , mylist ): self .mylist = mylist self .root=Node ( None ) for value in self .mylist : self .curr= self .root self ._add ( value ) def _add ( self , value ): if self .curr.value == None : self .curr.value = value else : if self .curr.value > value : if self .curr.left == None : self .curr.left = Node ( value ) else : self .curr = self .curr.left self ._add ( value ) else : if self...