Skip to content

Tag Archives: Veritas

  Storage Classes are used to describe the features of a variable/function. These features basically include the scope, visibility and life-time which help us to… Read More
Insertion sort is a simple sorting algorithm that works similar to the way you sort playing cards in your hands. The array is virtually split… Read More
  Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes some other algorithms (such as… Read More
Auxiliary Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output… Read More

Start Your Coding Journey Now!