RCS file: middle_of_linked_list.c,v
Working file: middle_of_linked_list.c
head: 1.15
branch:
locks: strict
access list:
symbolic names:
keyword substitution: kv
total revisions: 15;    selected revisions: 15
description:
Code to demonstrate how to find the middle of a linked list in C langauge.
—————————-
revision 1.15
date: 2014/02/27 00:23:55;  author: root;  state: Exp;  lines: +9 -1
Two conditions are added inside the while which will return the control to the calling function with the address of the middle node.

Status : The program is working absolutely fine for any number of nodes in a single linked list.
—————————-
revision 1.14
date: 2014/02/26 23:23:30;  author: root;  state: Exp;  lines: +10 -0
Status:Program is working correctly for an odd number of nodes inside the linked list.

Developing the code to find the middle of the linked list containing an even number of nodes inside the linked list.
—————————-
revision 1.13
date: 2014/02/26 22:53:31;  author: root;  state: Exp;  lines: +1 -1
Changed the prototype of the middle_of_list() function.Inside it an argument is passed that holds the address of the count variable.
—————————-
revision 1.12
date: 2014/02/26 22:50:22;  author: root;  state: Exp;  lines: +30 -3
Implemted the middle_of_list() function till 2 nodes in the linked list.
Checking…..
—————————-
revision 1.11
date: 2014/02/26 22:28:00;  author: root;  state: Exp;  lines: +10 -4
Prototype of the middle_of_list() function is declared and changed the prototype of the display_nodes() function to return the total number of nodes in the linked list.
Also called the middle_of_list() function from within the main() function.Implementing the body of the middle_of_list() function.
—————————-
revision 1.10
date: 2014/02/26 22:21:41;  author: root;  state: Exp;  lines: +2 -2
Till display_nodes() function,the program is working absolutely fine.Now implementing a function that finds the middle of the linked list.
—————————-
revision 1.9
date: 2014/02/26 21:09:52;  author: root;  state: Exp;  lines: +12 -2
Prototype of the display_nodes() function is declared.
Also gave definition of the display_nodes() function.
Checking….
—————————-
revision 1.8
date: 2014/02/26 21:01:33;  author: root;  state: Exp;  lines: +23 -1
create_node() function is called that creates a node at the end of the linked list.Its prototype is also declared.
Gave definition of the create_node() function.
—————————-
revision 1.7
date: 2014/02/26 20:56:19;  author: root;  state: Exp;  lines: +8 -0
Gave definition of the create_list() function.
—————————-
revision 1.6
date: 2014/02/26 20:53:19;  author: root;  state: Exp;  lines: +1 -0
Prototype of the create_list() function is declared.
—————————-
revision 1.5
date: 2014/02/26 20:50:42;  author: root;  state: Exp;  lines: +18 -2
A flag variable is declared.create_list() function is called that will create the linked list by creating a start node.After creating the start node the flag variable is set to 1 so that in case the user next time wishes to create the list,then a message is displayed that the linked list is created successfully.
—————————-
revision 1.4
date: 2014/02/26 20:38:17;  author: root;  state: Exp;  lines: +6 -1
A structure is defined of type struct node having two members:info and a pointer to the structure of type struct node.
—————————-
revision 1.3
date: 2014/02/20 02:36:03;  author: root;  state: Exp;  lines: +21 -0
Header file:<stdlib.h> is included to support exit() function.This function helps the user to terminate the program.
—————————-
revision 1.2
date: 2014/02/20 02:32:19;  author: root;  state: Exp;  lines: +12 -1
Prepared the MAIN MENU for the user,so that the operations can be selected by the user easily.
—————————-
revision 1.1
date: 2014/02/20 02:27:22;  author: root;  state: Exp;
Initial revision
=============================================================================