ex6.cpp File Reference

#include <iostream>
#include <cmath>

Include dependency graph for ex6.cpp:

Go to the source code of this file.

Classes
struct	Node

Functions
void	divide (Node *&head, Node *&second)
int	list_length (Node *head)
int	main ()
void	print_list (Node *head)
void	tail_insert (Node *&head, Node *&tail, int num)

Function Documentation

divide()

void divide	(	Node *&	head,
		Node *&	second )

Definition at line 49 of file ex6.cpp.

{
    if (head == NULL) {
        second = NULL;
        return;
    }
 
    int len = list_length(head);
    len = (len-1)/2;
 
    Node * current = head;
    for (int i = 0; i < len; ++i)
        current = current->next;
 
    // split after current
    second = current->next;
    current->next = NULL;
 
}

References list_length(), and Node::next.

Referenced by main().

Here is the call graph for this function:

Here is the caller graph for this function:

list_length()

int list_length

(

Node *

head

)

Definition at line 41 of file ex6.cpp.

{
    int i = 0;
    for (Node * current = head; current != NULL; current = current->next)
        ++i;
    return i;
}

References Node::next.

Referenced by divide().

Here is the caller graph for this function:

main()

int main

(

void

)

Definition at line 69 of file ex6.cpp.

{
    Node * head = NULL, * tail = NULL;
    int num = 0;
 
    // build linked list backward
    cout << "input integers (-999 to end): ";
    cin >> num;
    while ( num != -999 ) {
        tail_insert(head, tail, num);
        cin >> num;
    }
 
    // print the items in the linked list
    print_list(head);
 
    // divide
    cout << endl;
    Node * second = NULL;
    divide(head, second);
    print_list(head);
    print_list(second);
 
    return 0;
}

References divide(), print_list(), and tail_insert().

Here is the call graph for this function:

print_list()

void print_list

(

Node *

head

)

Definition at line 12 of file ex6.cpp.

{
    Node * current = head;
    while (current != NULL)
    {
        // process the current node, e.g., print the content
        cout << current->info << " -> ";
        current = current->next;
    }
    cout << "NULL\n";
}

References Node::info, and Node::next.

Referenced by main().

Here is the caller graph for this function:

tail_insert()

void tail_insert	(	Node *&	head,
		Node *&	tail,
		int	num )

Definition at line 24 of file ex6.cpp.

{
    Node * p = new Node;
    p->info = num;
    p->next = NULL;
 
    if (head == NULL) {
        head = p;
        tail = p;
    }
    else {
        tail->next = p;
        tail = p;
    }
}

References Node::info, and Node::next.

Referenced by main().

Here is the caller graph for this function: