What is Sorting in Data Structures ? Selection Sorting,Bubble Sorting

What is Sorting in Data Structures ? Selection Sorting,Bubble Sorting

Sorting :Sorting refers to arranging data in a particular format. Sorting algorithm specifies the way to arrange data in a particular order. Most common orders are in numerical or lexicographical order.Bubble Sort is a simple algorithm which is used to sort a given set of n elements provided in form of an array with n number of elements. Bubble Sort compares all the element one by one and sort them based on their values.

Read more

Data Structures & Algorithm Basic Concepts

Data Structures & Algorithm Basic Concepts

Data Structures & Algorithm Basic Concepts : Data structure introduction refers to a scheme for organizing data, or in other words a data structure is an arrangement of data in computer’s memory in such a way that it could make the data quickly available to the processor for required calculations.

Read more

What is Push function in Simple Stack ?

What is Push function in Simple Stack ?

Simple Stack :Stack is an ordered list of similar data type. Stack is a LIFO structure. (Last in First out). push() function is used to insert new elements into the Stack and pop() is used to delete an element from the stack. Both insertion and deletion are allowed at only one end of Stack called Top.

Read more

What is Simple List in Data Structures And How To Add in Start,Add in END,Add in Specific Location

What is Simple List in Data Structures And How To Add in Start,Add in END,Add in Specific Location

Simple List in Data Structures : Insertion into a singly-linked list has two special cases. It’s insertion a new node before the head (to the very beginning of the list) and after the tail (to the very end of the list). In any other case, new node is inserted in the middle of the list and so, has a predecessor and successor in the list.

Read more