Inward Sort (Python)

README.md

Inward Sort

An inefficient sorting algorithm I made up at 2 o'clock in the morning while playing with cards.

---

Give the algorithm a list of random values.

There are two lists: the base list (which includes the user's input values) and the memory list.

In the base list, the algo compares the two outermost values. Then, it slowly moves towards the centre, comparing every pair of values, adjacent to the one before. The algo stops whenever it has reached the centre value or there is nothing left to compare.

The algorithm takes the very last member of the base list and prepends it to the memory list. Then, the cycle continues, until all values of the base list are placed in the memory list. At this point, the order should be different between the memory and the beginning state of the base list.

The cycle is continued for the memory list. However, after reaching the centre, the base takes the leftmost member of the memory and appends that member to itself. This repeats until all values of the memory have switched on to the base list.

At the end, the base list should output the correct ascending order of the values.

Why it works

I have no idea

How well it works

Supposedly very well

InwardSort.py

import math

def InwardSort():
    print("--- Inward Sort ---")
    a = [int(i) for i in input("List: ").split()]
    b = 0
    d = []
    for i in range(0,len(a)):
        for i in range(0,math.ceil(len(a)/2)):
            if a[b] > a[len(a)-1-b]:
                c = a[b]
                a.insert(b,a[len(a)-1-b])
                del a[b+1]
                a.insert(len(a)-b-1,c)
                del a[len(a)-b-1]
            b = b + 1
            continue
        d.insert(0,a[len(a)-1])
        del a[len(a)-1]
        b = 0
        continue
    for i in range(0,len(d)):
        for i in range(0,math.ceil(len(d)/2)):
            if d[b] > d[len(d)-1-b]:
                c = d[b]
                d.insert(b,d[len(d)-1-b])
                del d[b+1]
                d.insert(len(d)-b-1,c)
                del d[len(d)-b-1]
            b = b + 1
            continue
        a.insert(len(a),d[0])
        del d[0]
        b = 0
        continue
    print("Result: ",a)
    print("--- End of command ---")