-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinked List.cs
More file actions
214 lines (181 loc) · 7.2 KB
/
Linked List.cs
File metadata and controls
214 lines (181 loc) · 7.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace Linked_List
{
public partial class Form1 : Form
{
int HeadPointer = 2;
int FreePointer = 5;
Node[] LinkedList = new Node[10];
// Create a node structure for each element
struct Node
{
public string Name;
public int Pointer;
}
public Form1()
{
InitializeComponent();
}
void CreateLinkedList()
{
LinkedList[2].Name = "Apple";
LinkedList[2].Pointer = 1;
LinkedList[1].Name = "Cat";
LinkedList[1].Pointer = 4;
LinkedList[4].Name = "Fox";
LinkedList[4].Pointer = 3;
LinkedList[3].Name = "Horse";
LinkedList[3].Pointer = 0;
LinkedList[0].Name = "Mouse";
LinkedList[0].Pointer = -1; // -1 as that is the end of the linked list
int DataItems = FreePointer;
for (int FreeSpace = DataItems; FreeSpace < LinkedList.Length; FreeSpace++)
{
LinkedList[FreeSpace].Name = "Empty";
if (FreeSpace != (LinkedList.Length - 1))
{
LinkedList[FreeSpace].Pointer = FreeSpace + 1;
}
else
{
LinkedList[FreeSpace].Pointer = -1;
}
}
DisplayLinkedList();
}
private void DisplayLinkedList()
{
lblHeadPointer.Text = "Head pointer: " + HeadPointer;
lblFreePointer.Text = "Free Pointer: " + FreePointer;
// Loops through the 'linked list' and displays all nodes
for (int ToDisplay = 0; ToDisplay < LinkedList.Length; ToDisplay++)
{
string Text = ToDisplay.ToString() + " " + LinkedList[ToDisplay].Name + " " + LinkedList[ToDisplay].Pointer + "\r\n";
if (LinkedList[ToDisplay].Name != "Empty")
{
lblDataOutput.Text += Text;
}
else
{
lblFreeSpace.Text += Text;
}
}
}
// Searches through the linked list via the pointers
private void btnSearch_Click(object sender, EventArgs e)
{
string Input = txtSearch.Text;
if (Input != "")
{
bool Found = false;
int TempHead = HeadPointer;
string MessageText = Input + " is found in: \n";
for (int Item = 0; Item < LinkedList.Length; Item++)
{
if (TempHead != -1)
{
if (LinkedList[TempHead].Name.ToUpper().Contains(Input.ToUpper()) && LinkedList[TempHead].Name != "Empty")
{
MessageText += LinkedList[TempHead].Name + ", memory location: " + TempHead + "\n";
Found = true;
}
TempHead = LinkedList[TempHead].Pointer;
}
else break;
}
// Display findings on screen
if (Found)
{
MessageBox.Show(MessageText);
}
else
{
MessageBox.Show(Input + " cannot be found in the linked list");
}
}
}
// Adding an item into the linked list
private void btnAdd_Click(object sender, EventArgs e)
{
string Input = txtAdd.Text;
if (Input != "")
{
// If the following does not work that means the memory is full
try
{
// Add into memory
int TempFreePointer = LinkedList[FreePointer].Pointer;
LinkedList[FreePointer].Name = Input;
LinkedList[FreePointer].Pointer = HeadPointer;
HeadPointer = FreePointer;
FreePointer = TempFreePointer;
// Display
lblDataOutput.Text = "";
lblFreeSpace.Text = "";
DisplayLinkedList();
}
catch
{
MessageBox.Show("No free memory");
}
}
}
private void btnDelete_Click(object sender, EventArgs e)
{
try
{
int Location = Int32.Parse(txtDelete.Text); // Check input is an int
if (LinkedList[Location].Name != "Empty") // If the slot is isnt an empty slot
{
Console.WriteLine("Checkpoint ");
int TempHead = HeadPointer;
int TempPointer = LinkedList[Location].Pointer; // Look at pointer
if (Location == HeadPointer) // Set head pointer to our deleted cell's pointer if the head pointer pointed to our deleted cell
{
HeadPointer = TempPointer;
}
else // Otherwise find which node points to that deleted cell and set its pointer to the deleted cell's pointer
{
for (int Item = 0; Item < LinkedList.Length; Item++) // Loop through however many items there are
{
if (TempHead != -1) // if its not the end of the list
{
if (LinkedList[TempHead].Pointer == Location) // check if we found the node that points to the node we are deleting
{
LinkedList[TempHead].Pointer = TempPointer;
break;
}
TempHead = LinkedList[TempHead].Pointer;
}
else break;
}
}
int TempFree = FreePointer;
FreePointer = Location;
LinkedList[Location].Pointer = TempFree;
LinkedList[Location].Name = "Empty";
// Display
lblDataOutput.Text = "";
lblFreeSpace.Text = "";
DisplayLinkedList();
}
}
catch
{
MessageBox.Show("Enter a correct memory slot");
}
}
private void Form1_Load(object sender, EventArgs e)
{
CreateLinkedList();
}
}
}