Doubly Linked listA doubly linked list (DLL) is a type of linked list where each node has a pointer to both the previous node and the next node. SNOperationDescription 1Insertion at beginningAdding the node into the linked list at beginning. 2Insertion at end...May 19, 2024·18 min read
Merge SortMerge sort is a sorting method that uses the divide-and-conquer strategy. It works by splitting the input array into smaller subarrays, sorting those subarrays, and then merging them back together to get the sorted array. Simply put, merge sort divid...May 14, 2024·4 min read
Insertion SortInserInsertion sort is a basic sorting method where you place each item from an unsorted list into its proper position in a sorted section of the list. It's a stable sorting method, ensuring that items with the same values stay in their original orde...May 13, 2024·5 min read
Bubble SortBubble sort is a basic sorting method. It works by comparing pairs of neighboring elements and swapping them if they are not in the correct order. This method is not efficient for sorting large amounts of data because its average and worst-case compl...May 12, 2024·4 min read
Selection SortSelection sort is considered one of the fundamental sorting algorithms due to its simplicity and effectiveness. The way it operates is by iteratively identifying the smallest (or largest) element from the unsorted section of the list and relocating i...May 11, 2024·3 min read
Binary SearchBinary search is a search method used to locate the position of a target value in a sorted array. It divides the search range in half until finding the target value or depleting the range. This is done by comparing the target with the middle value of...May 10, 2024·4 min read
Linear SearchWhat is Linear Search? Linear Search is a fundamental searching algorithm used to find a specific element within a collection of elements. When employing Linear Search, each element in the collection is inspected individually in a sequential order un...May 9, 2024·3 min read