Lesson 2: Linked List Implementation

After learning about Singly Linked List, now let's see what are their implications.

As you all know from the previous lesson, single linked list only have a tail that points towards the next data. Now for example you want to make a MP3 player that could play all the songs and repeat it again as soon as it finishes its last song. Some of you may think that using a single linked list isn't possible here. But there is a trick to it in order for you to recall the first data from the last data. And to do that, we are going to make a special single linked list called the Circular Linked List!

Circular Singly Linked List

First Lesson (Part 2) : Linked List

Hey guys, this is the continuation of the first lesson. Last time we talked about Arrays and Pointers. Now we are going to apply both of those topics into this new topic that we are going to learn.

Linked list is somewhat similar to struct of array, it's used to store some data that are somewhat related. Example is storing data of name and age using either linked list or array are possible. But there are also differences between those two. Array are stored in a fixed memory while you can always add more memory space when you're using linked list. The down side of using linked list is the process will take slower time and it is a lot more difficult to do instead of using just arrays. You will understand why later on in this discussion.

First Lesson: Array and Pointer

First of all what I have learned this week are Array, Pointers and Linked List. I will divide this lessons into 2 posts because it may be too long. So here are the lessons for today.

Introduction

Hey Guys, for you guys who already know me then Hi and for you who haven't know me yet then... Hi my name is Andrew, pleased to meet ya. Some of you may have known me from the previous blog I had made which is the Andrew's Section. This new blog I made will have a different goal and mission from the previous blog I had made.