Insertion Sort

Easy Sorting Algorithms
Solve in Playground →

Problem Statement

Write a C program to implement Insertion Sort to sort an array of integers in ascending order.

Input Format

First line: N. Second line: N space-separated integers.

Output Format

Print the sorted array separated by a space.

Constraints

1 <= N <= 1000

Sample Input

5
12 11 13 5 6

Sample Output

5 6 11 12 13

Explanation

Builds the final sorted array one item at a time.

Starter Code

#include <stdio.h>

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        int arr[n];
        for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
        // Write your code here
    }
    return 0;
}

Limits

  • Time Limit: 1s
  • Memory Limit: 256MB

Embedded C Programming

Updated: March 15, 2026
Intermediate

Embedded systems rely on efficient low-level programming to interact directly with hardware. In this course, you will learn how to write practical Embedded C programs used in real microcontroller-based systems. Rather than focusing only on theory, this course follows a practice-driven approach. Each lesson includes hands-on coding exercises that simulate real firmware development tasks used