A common way to implement a queue using an array is to use two pointers, one for enqueue at the end and one for dequeue at the beginning. Elements are shifted as needed to accommodate new elements and maintain the order of the queue.

The best-case time complexity of Insertion Sort is O(1). This occurs when the input array is already sorted, and the algorithm needs only to check each element once.

Radix sort is often used to sort data represented in the hexadecimal numeric base. It operates by processing digits from the least significant digit to the most significant digit.

Merge sort can efficiently handle the sorting of linked lists. Unlike array-based sorting algorithms, merge sort's divide-and-conquer approach is well-suited for linked lists as it involves splitting and merging without the need for random access to elements. This makes it a preferred choice for sorting linked structures.

Insertion Sort is an incremental sorting algorithm that builds the final sorted array one element at a time. It iterates through the array, comparing and inserting elements in their correct positions.

Regular expression matching involves searching for patterns in text. Regular expressions are powerful tools for pattern matching and manipulation in strings.

The main idea behind Insertion Sort is to build the sorted array one element at a time. It starts with the first element and iteratively compares and inserts the current element into its correct position in the already sorted subarray. This process continues until the entire array is sorted.

The resulting linear ordering of vertices in topological sorting maintains the property of preserving edge direction. It ensures that for every directed edge (u, v), vertex 'u' comes before 'v' in the ordering, representing a valid sequence of dependencies.

Bubble sort performs well when the list is presorted or nearly sorted because it requires fewer comparisons to complete. In a nearly sorted list, many elements are already in their correct positions, reducing the number of swaps needed, making the algorithm more efficient in such scenarios.

A doubly linked list contains nodes that have two pointers: one pointing to the next node in the sequence and another pointing to the previous node. This allows for easy traversal in both directions.