Creating of LinkedList

Samanvi Thota — Sun, 17 Oct 2021 13:37:28 +0000

The LinkedList class of the Java collections framework provides the functionality of the linked list data structure (doubly linkedlist).

Each element in a linked list is known as a node. It consists of 3 fields:
Prev - stores an address of the previous element in the list. It is null for the first element
Next - stores an address of the next element in the list. It is null for the last element
Data - stores the actual data

Syntax for creating a LinkedList:

LinkedList<Type> linkedList = new LinkedList<>();

Here, Type indicates the type of a linked list. For example,

// create Integer type linked list

LinkedList<Integer> linkedList = new LinkedList<>();

// create String type linked list

LinkedList<String> linkedList = new LinkedList<>();

Example Program to create LinkedList:

import java.util.LinkedList;

class Main {
  public static void main(String[] args){

    // create linkedlist
    LinkedList<String> animals = new LinkedList<>();

    // Add elements to LinkedList
    animals.add("Dog");
    animals.add("Cat");
    animals.add("Parrot");
    System.out.println("LinkedList: " + animals);
  }
}

OUTPUT:

LinkedList: [Dog, Cat, Parrot]

Performance Measurement

Samanvi Thota — Thu, 06 May 2021 17:52:56 +0000

Performance Measurement: It is based on space and time requirements of a particular algorithm. These quantities depend on the compiler and options used, and the system on which the algorithm runs. The space and time needed for compilation are important during program testing. To obtain the run time of a program, we need a clocking procedure. We assume the existence of a program GetTime() that returns the current time in milliseconds.

Suppose if we want to measure the worst-case performance of the sequential search algorithm
we need to follow these:
1.decide on the values of n for which the times are to be obtained
2.determine for each of the above values of the data that exhibit the worst-case behavior.

Algorithm:
SeqSearch(a,x,n)
//search for x in a[1:n]. a[0] is used as additional space.
{
i:=n; a[0] :=x;
while (a[i]=!x) do i := i-1;
return i;
}

click here, for more detailed explanation with example

DEV Community: Samanvi Thota

Creating of LinkedList

Performance Measurement