## C Program for Recursive Insertion Sort

Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands. Below is an iterative algorithm for insertion… Read More »

- TCS Coding Practice Question | Check Palindrome Number
- TCS Coding Practice Question | Reverse a String
- TCS Coding Practice Question | Palindrome String
- TCS Coding Practice Question | Reverse a Number
- Interesting Facts in C Programming | Set 2
- time.h header file in C with Examples
- TCP Client-Server Program to Check if a Given String is Palindrome
- Lex Program to remove comments from C program
- Lex program to find the length of the longest word
- Lex program to implement a simple Calculator
- Lex program to search a word in a file
- C program to store Student records as Structures and Sort them by Age or ID
- Lex Program to accept string starting with vowel
- Lex program to find the Length of a String
- What is a Pointer to a Null pointer
- Lex Program to print the total characters, white spaces, tabs in the given input file
- Lex program for Decimal to Hexadecimal Conversion
- Lex program to check perfect numbers
- Lex program to check whether input number is odd or even
- How to Append a Character to a String in C
- Lex code to replace a word with another word in a file

Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands. Below is an iterative algorithm for insertion… Read More »

Given two integers n and k. Find position the n’th multiple of K in the Fibonacci series. Examples: Input : k = 2, n =… Read More »

We have N coins which need to arrange in form of a triangle, i.e. first row will have 1 coin, the second row will have… Read More »

Problem: Given an array arr[] of n elements, write a function to search a given element x in arr[]. C/C++ filter_none edit close play_arrow link… Read More »

Given a range [n, m], find the number of elements that have odd number of factors in the given range (n and m inclusive). Examples:… Read More »

Given a number x, determine whether the given number is Armstrong number or not. A positive integer of n digits is called an Armstrong number… Read More »

This is basically a variation of bubble-sort. This algorithm is divided into two phases- Odd and Even Phase. The algorithm runs until the array elements… Read More »

Given a number “n”, find its total number of divisors is even or odd. Examples : Input : n = 10 Output : Even Input:… Read More »

Given a positive integer, check if the number is prime or not. A prime is a natural number greater than 1 that has no positive… Read More »

Given a value V, if we want to make change for V Rs, and we have infinite supply of each of the denominations in Indian… Read More »

GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and… Read More »

Following is a typical recursive implementation of Merge Sort that uses last element as pivot. filter_none edit close play_arrow link brightness_4 code /* Recursive C… Read More »

Given two sorted arrays and a number x, find the pair whose sum is closest to x and the pair has an element from each… Read More »

There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs… Read More »