Microsoft announced last year that it has planned to have one billion devices which will be running on their latest window i.e. Windows 10 by the mid of
Reversing a linked list is one of the most commonly asked data structure interview questions. Shown the linked list 10, 20, 30. After reversed operation, it should be
Heap Sort is comparison based sorting algorithm. It uses binary heap data structure. Heap Sort can be assumed as improvised version of Selection Sort where we find the
Insertion to linked list can be done in three ways: Inserting a node at the front of linked list. Inserting a node at the end of linked list. Inserting a
Data types are particular kind of data items which can hold some special kind of values. Python provides various built-in data types with a wide range of inbuilt
Quick Sort also uses divide and conquer technique like merge sort, but does not require additional storage space. It is one of the most famous comparison based sorting
Linked list is a linear data structure, linear refers to storing the elements sequentially in the form of nodes. Unlike arrays, here each element is linked using pointers
