Linked Lists

Description

Code that defines a custom list class (linked lists) and implements and time sorting algorithms on it
Data Structure

List of nodes
python-lists-in-python/main.py
Lines 7 to 9 in 56f69ac
    
           class linked_list(): 
        
               def __init__(self, contents=[], first=None): 
        
                   self.first = linked_list.__node(None,first)
Nodes

Nodes have a number in them and point to another node
python-lists-in-python/main.py
Lines 15 to 18 in 56f69ac
    
           class __node(): 
        
               def __init__(self, item, next=None): 
        
                   self.item = item 
        
                   self.next = next
Sorting Algorithms

	Bubble	Selection	Insertion	Merge	Quick
Time Complexity	O(n²)	O(n²)	O(n²)	O(n log n)	O(n log n)
Bubble

Compares pairs of elements and swaps them if they are out of order
Selection

Takes the smallest element of the main list and adds it to a sub-list until
Insertion

Takes one element and puts it in its spot
Merge

Splits the list into elements then merges pairs of sub-lists keeping the elements in order until is one list again
Quick

Selects a pivot and moves all smaller elements to one side it then does the same to each side of the list
Name		Name	Last commit message	Last commit date
Latest commit History 17 Commits
README.md		README.md
main.py		main.py
merge_sort100.csv		merge_sort100.csv
merge_sort1000.csv		merge_sort1000.csv
merge_sort1E+06.csv		merge_sort1E+06.csv
merge_sort1E+07.csv		merge_sort1E+07.csv
	class linked_list():
	def __init__(self, contents=[], first=None):
	self.first = linked_list.__node(None,first)
	class __node():
	def __init__(self, item, next=None):
	self.item = item
	self.next = next