Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/d3/dce/linkedlist__implentation__usingarray_8cpp.html below:

TheAlgorithms/C++: data_structures/linkedlist_implentation_usingarray.cpp File Reference

Loading...

Searching...

No Matches

Linked list implementation using Arrays. More...

#include <iostream>

Go to the source code of this file.

Linked list implementation using Arrays.

The difference between the pointer implementation of linked list and array implementation of linked list:

1. The NULL is represented by -1;
2. Limited size. (in the following case it is 100 nodes at max). But we can reuse the nodes that are to be deleted by again linking it bacj to the list.

Definition in file linkedlist_implentation_usingarray.cpp.

Definition at line 69 of file linkedlist_implentation_usingarray.cpp.

69 {

70 int temp = head;

71 while (temp != -1) {

74 }

75 std::cout << "-1" << std::endl;

76}

Node AvailArray[100]

array that will act as nodes of a linked list.

This function when called will delete the node with the index presented as an argument, and will put back that node into the array.

Definition at line 42 of file linkedlist_implentation_usingarray.cpp.

42 {

44 avail = nodeToBeDeleted;

45}

This will return the index of the first free node present in the avail list

Definition at line 32 of file linkedlist_implentation_usingarray.cpp.

32 {

33 int NodeIndexToBeReturned = avail;

35 return NodeIndexToBeReturned;

36}

Main function

Definition at line 79 of file linkedlist_implentation_usingarray.cpp.

79 {

80 initialise_list();

81 int x, y, z;

82 for (;;) {

83 std::cout << "1. Insert At The Beginning" << std::endl;

84 std::cout << "2. Insert At The End" << std::endl;

85 std::cout << "3. Display" << std::endl;

86 std::cout << "4.Exit" << std::endl;

87 std::cout << "Enter Your choice" << std::endl;

88 std::cin >> z;

89 switch (z) {

90 case 1:

91 std::cout << "Enter the number you want to enter" << std::endl;

92 std::cin >> x;

94 break;

95 case 2:

96 std::cout << "Enter the number you want to enter" << std::endl;

97 std::cin >> y;

98 insertAtTheEnd(y);

99 break;

100 case 3:

101 std::cout

102 << "The linked list contains the following element in order"

103 << std::endl;

104 display();

105 break;

106 case 4:

107 return 0;

108 default:

109 std::cout << "The entered choice is not correct" << std::endl;

110 }

111 }

112

113 return 0;

114}

void insertAtTheBeginning(int data)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4