Showing posts with label Data Structure & Algorithm. Show all posts
Showing posts with label Data Structure & Algorithm. Show all posts

Bubble Sort

Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted. It is called Bubble Sort because smaller elements "bubble" to the top of the...

Quick Sort

 Quick Sort Quick Sort is a sorting algorithm first proposed by Charles Antony Richard Hoare in 1960, and since then, many people have modified and improved it.  Even after more than half a century since its introduction, Quick Sort remains one of the fastest sorting algorithms...

Hash table

What is Hashtable?  A Hashtable is a data structure that stores key-value pairs, allowing for efficient access and retrieval of values based on their associated keys. In a Hashtable, the key is used to calculate an index into an array of buckets, which contain the values. ...

Stack

     ⁉️What is a Stack?A stack is an abstract data type that follows the Last-In-First-Out (LIFO) principle. In a stack, elements are inserted and removed from only one end, which is known as the top of the stack.👍Advantages of Stack:Easy to implement and use.Efficient memory management.Supports...

Queue

 ⁉️What is Queue?    A Queue is a data structure that stores elements in a First-In-First-Out (FIFO) order. In a queue, elements are added from the back, known as the "enqueue" operation, and removed from the front, known as the "dequeue" operation. Queues are used...

Double Linked List

 ⁉️What is Linked List?    Double linked list is a data structure in which each node has two pointers, one pointing to the previous node and another to the next node. This allows for bidirectional traversal of the list, making it easier to access and manipulate data.👍Advantages...

Linked List

⁉️What is Linked List?     A linked list is a data structure where each node contains data and a pointer, and is connected in a single line to store data. Each node includes a pointer that points to the next node.     The pointer that points to the next node...
Subscribe to: Posts (Atom)