Here we’ll see the possible solutions of finding the second largest element in an array. By Sorting the Array: Easy solution that I can think of to find the second largest element in an array is to first sort the array and then pick the second or second last element of the array depending on … Continue reading “C Program to Find Second Largest Element in an Array”
Author: Srikanta
I write here to help the readers learn and understand computer programing, algorithms, networking, OS concepts etc. in a simple way. I have 20 years of working experience in computer networking and industrial automation.
How to Implement Shell Sort in C Programming?
Shell Sort (aka shellsort) can be thought as an improvement over insertion sort. To understand shell sort, we have to recall how insertion sort works. In insertion sort at any moment, the whole array is sub-divided in two sections, one is sorted and another is not. One element is picked from the unsorted section and compares with the … Continue reading “How to Implement Shell Sort in C Programming?”
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 two or three times faster than other efficient sorting algorithms like merge sort or heap sort. Here we’ll see how to implement this sorting algorithm … Continue reading “How to Implement Quick Sort in C?”
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 algorithm. Here we’ll see how to implement merge sort in C programming language. And also we’ll analyze its performance in various conditions. Merge Sort Algorithm … Continue reading “How to Implement Merge Sort in C?”
Implement Bubble Sort in C
Bubble Sort is the most popular sorting algorithm that most programmers start with. Even though its performance is not good enough for most practical cases, it is much simpler than other efficient sorting algorithms like quick sort or merge sort. Bubble Sort Algorithm Bubble sort is to continuously swap two adjacent elements if they are … Continue reading “Implement Bubble Sort in C”