Algorithm for circular linked list






step1:create a structure containing data part and link part.
Step2:read the case 
step3:case1,perform insertfront function
      case2,perform insertend function
      case3,perform insertany function
      case4,perform deletefront function
      case5,perform deleteend function
      case6,perform deleteany function
      case7,exit

insertfront function

1. Create the new node
2. Set the new node’s next to itself (circular!)
3. If the list is empty,return new node.
4. Set our new node’s next to the front.
5. Set tail’s next to our new node. 
6. Return the end of the list.


insertatany function

1:creating an new node
2:if newnode=null then print memory underflow
3:else
            search for the given location
4:insert node at given location
5:put newnode's link in next node
6:return the end of the list



insertend function

1. Create the new node
2. Set the new node’s next to itself (circular!) 
3. If the list is empty,return new node.
4. Set our new node’s next to the front.
5. Set tail’s next to our new node. 
6. Return the end of the list.

deletefront function

1. Check whether list is Empty (head == NULL)
2. If it is Empty then, display 'List is Empty!!! Deletion is not possible' and terminate the function.
3. If it is Not Empty then, define two Node pointers 'temp1' and 'temp2' and initialize both 'temp1' and 'temp2' with head.
4. Check whether list is having only one node (temp1 → next == head)
5. If it is TRUE then set head = NULL and delete temp1 (Setting Empty list conditions)
6. If it is FALSE move the temp1 until it reaches to the last node. (until temp1 → next == head )
7. Then set head = temp2 → next, temp1 → next = head and delete temp2


deleteend function

1. Check whether list is Empty (head == NULL)
2. If it is Empty then, display 'List is Empty!!! Deletion is not possible' and terminate the function.
3. If it is Not Empty then, define two Node pointers 'temp1' and 'temp2' and initialize 'temp1' with head.
4. Check whether list has only one Node (temp1 → next == head)
5. If it is TRUE. Then, set head = NULL and delete temp1. And terminate from the function. (Setting Empty list condition)
6. If it is FALSE. Then, set 'temp2 = temp1 ' and move temp1 to its next node. Repeat the same until temp1 reaches to the last node in the list. (until temp1 → next == head)
7. Set temp2 → next = head and delete temp1.

deleteany function


1.Check whether list is Empty (head == NULL)
2.If it is Empty, then display 'List is Empty!!!'and terminate the function.
3. If it is Not Empty then, define a Node pointer 'temp' and initialize with head.
4.Keep displaying temp → data with an arrow (--->) until temp reaches to the last node
5.Finally display temp → data with arrow pointing to head → data.

Step4: Stop

Comments

Post a Comment

Popular posts from this blog

Node.js Cheat Sheet

Image
To start a new node project, type  C:\Users\jinoy\OneDrive\Desktop\MERN>npm init -y      The basic syntax of calling a function in node.js with express is : const   functionname  = ()  =>  { console . log ( "hello world" ); } functionname (); To call a function after every 5 seconds : setInterval (()  =>  {      console . log ( "hello" ); }, 5000  ); To call a function only once after 4 second : setTimeout (() => { console . log ( "test" ); }, 4000 ); To run a script.js file on terminal, type : C:\Users\jinoy\OneDrive\Desktop\MERN>node script.js  OR C:\Users\jinoy\OneDrive\Desktop\MERN>node script To stop a function that is executing on every interval( time to call function again) : const   interval  =  setInterval (()  =>  {      console . log ( "hello" ); }, 1000  ); setTimeout (() => {      clearInterva...
Read more

Codeigniter ! Simple But Powerful

Image
CodeIgniter is a powerful PHP framework with a very small footprint, built for developers who need a simple and elegant toolkit to create full-featured web applications. It is the second largest php framework for website development (first-Laravel). Due to its simplicity, it is the most used framework ever than laravel. Actually these frameworks are only used for developing large scale website. The important thing about this framework is that it is using MVC principle . A MVC or Model View Control framework has a controller that controls all the pages in the website. There can be any number of controller created in codeigniter. The orginal webpages or the contents are placed in the folder named view .  Note : Don't touch the forder named system because it is the soul of the codeigniter Next ⇒
Read more

Enhancing Supply Chain Security and Cloud-Native Development with Chainguard

Image
In the ever-evolving landscape of software development, ensuring supply chain security and embracing cloud-native practices are paramount. One solution that stands out in addressing these concerns is Chainguard, a platform providing secure images for development environments. Recently, I had the opportunity to explore Chainguard's capabilities firsthand through a sponsored video collaboration. The video delved into the seamless integration of Chainguard images into various development workflows, highlighting the significant advantages they offer in terms of security and efficiency. From hosting images on platforms like ECS, Apprunner, and Google Cloud Run to leveraging DockerHub for streamlined deployment, Chainguard simplifies the process while enhancing security measures. What sets Chainguard apart is its proactive approach to security. Images are rebuilt daily and frequently patched, minimizing vulnerabilities and mitigating risks associated with outdated dependencies. This ...
Read more