Modules

Binary Search Linear Search Bubble Sort Insertion Sort Linked List Binary Tree Combined Algorithm Stacks Queues Js Canvas Html Modules

Other Features

Night Updates Dev Mode

Linked List

The python code is approved and is functioning properly...

Psuedocode


#Coded by Revise Zone | Indenting is required

TYPE NODE
  DECLARE Data:STRING
  DECLARE:Pointer:INTEGER
END TYPE
DECLARE List:ARRAY[1:10] OF NODE
//TO INITIALISE THE ARRAY
Nullptr←-1
Freeptr←0
Startptr←Nullptr
FOR i ← 0 TO 9
List[i].Pointer←i+1
List[10].Pointer←Nullptr

//To PUSH AND ADD NEW ITEMS
PROCEDURE PUSH(DATA)
//Could also be compared with -1
 IF Freeptr <> Nullptr
    THEN 
	   CurrentNode←Freeptr
	   List[CurrentNode].Data←DATA
	   Freeptr←List[Freeptr].Pointer
	   Previousptr←Nullptr
	   CheckNode←Startptr
	   WHILE CheckNode<>-1 AND List[CheckNode].Data < DATA DO
	        Previousptr←CheckNode
			CheckNode←List[CheckNode].Pointer
	   ENDWHILE	
	   IF Previousptr=Nullptr
	        THEN
			  //Incase there is only one node in the array
			  List[CurrentNode].Pointer←Startptr
			  Startptr←CurrentNode
			ELSE
               List[CurrentNode].Pointer←List[Previousptr].Pointer	
               List[Previousptr].Pointer←CurrentNode				   
END PROCEDURE


PROCEDURE POP(DATA) 
  //START AT THE TOP
  CheckNode←Startptr
  WHILE CheckNode<>-1 AND List[CheckNode].Data <> DATA
     Previousptr←CheckNode
	 CheckNode←List[CheckNode].Pointer
  END WHILE
  IF CheckNode<>Nullptr
     THEN
        IF CheckNode←Startptr
		    THEN
		    //Makes it unaccessable
              Startptr←List[Starptr].Pointer	

            ELSE
              List[Previousptr].Pointer←List[CurrentNode].Pointer
	      
        END IF	
        List[CurrentNode].Pointer←Freeptr
        Freeptr←CheckNode	
FUNCTION FIND(Search)
 Checkptr←Startptr
 WHILE Checkptr <>-1 AND List[Checkptr].Data<>Search DO
    Checkptr←List[Checkptr].Pointer
 ENDWHILE
 RETURN Checkptr 
END FUNCTION
PROCEDURE ACCESS()
 Checkptr←Startptr
 WHILE CheckPtr <>-1 AND List[Checkptr].Data<>Search DO
    OUTPUT Checkptr
    Checkptr←List[Checkptr].Pointer
 ENDWHILE

Python Algorithm

The code is in python for this algorithm

#Coded by Revise Zone | Indenting is required
#Creating a linked list
class node:
    def __init__(self):
     self.pointer=0;
     self.data=""

Array=[node() for i in range(10)]
for i in range(10):
    Array[i].pointer=i+1
Array[9].pointer=-1

Freeptr=0
Nullptr = -1
Startptr=Nullptr

def Push(Item):
    global Freeptr
    global Nullptr
    global Array
    global Startptr
    if Freeptr != Nullptr:
        Currentptr=Freeptr
        Freeptr=Array[Currentptr].pointer
        Array[Currentptr].data=Item
        Previousptr=Nullptr
        Checkptr=Startptr
       
        while  Checkptr != Nullptr and Array[Checkptr].data < Item:

Previousptr=Checkptr
            Checkptr=Array[Checkptr].pointer
            
        if Previousptr == Nullptr:
            Array[Currentptr].pointer=Startptr
            Startptr=Currentptr

else:
            Array[Currentptr].pointer=Array[Previousptr].pointer
            Array[Previousptr].pointer= Currentptr
    else:
         print("Linked list full")

def find(Data):

CurrentNode=Startptr
    while CurrentNode != Nullptr and Array[CurrentNode].data != Data:
        CurrentNode = Array[CurrentNode].pointer
    return CurrentNode

def Access():

CurrentNode=Startptr
    while CurrentNode != Nullptr:
        print(Array[CurrentNode].data)
        CurrentNode = Array[CurrentNode].pointer

def pop(Data):
   
    global Freeptr
    global Nullptr
    global Array
    global Startptr
    Checkptr=Startptr
    while Checkptr != Nullptr and Array[Checkptr].data != Data:
        Previousptr=Checkptr
        Checkptr=Array[Checkptr].pointer
    if Checkptr != Nullptr:
        if Checkptr == Startptr:
            Startptr=Array[Startptr].pointer
        else:
             Array[Previousptr].pointer=Array[Checkptr].pointer
        Array[Checkptr].pointer=Freeptr
        Freeptr=Checkptr
    else:
         print(Data,"Not found to delete")
#THIS PART IS JUST TO TEST
         
Push("A")
Push("B")
Push("C")
Push("D")
Push("E")
Push("F")
Push("G")
Push("H")
Push("K")
Push("L")
Push("M")
Push("N")
print(find("A"))
print(find("E"))
print(find("V"))

pop("R")
pop("E")
pop("V")
pop("I")
pop("A")
pop("X")
pop("E")
pop("O")
pop("K")
pop("Y")
pop("Q")
print("\n")
print("This is the array after deleting...")
Access()

The code is free for anyone to copy and use...The copied code must have the same code and indentation as above

Try it yourself

Download Py