How to Implement Quick Sort in C?
Quick Sort is an efficient sorting algorithm developed by Tony Hoare in 1959. It is still a commonly used sorting algorithm in most practical cases. If implemented properly, it is…
How to Implement Merge Sort in C?
Merge sort is an efficient, general-purpose sorting algorithm. Unlike bubble sort or insertion sort, it is usable in most practical cases. Merge sort implementation is based on divide and conquer…
Implement Bubble Sort in C
Bubble Sort is one of the most fundamental sorting algorithms, often introduced early in programming courses due to its simplicity. Although not efficient for large datasets, it serves as a…
How to Implement Insertion Sort in C Programming?
Insertion sort is very popular sorting algorithms because of its simplicity. Its performance is not as good as quicksort or shellsort for large array but it is very simple like bubble sort.…
Parse and Print XML File in Tree Form using libxml2 in C
XML file is widely used format to store and transport data over internet. Parsing XML file is a very basic programming requirement. Here we'll see how to parse and print…