Stable Sort Check

Easy Sorting Algorithms

Solve in Playground →

Problem Statement

Identify whether Bubble Sort, Selection Sort, and Insertion Sort are stable sorting algorithms. Print ‘Stable’ or ‘Unstable’ based on query.

Input Format

A string containing the algorithm name ('Bubble', 'Selection', or 'Insertion').

Output Format

Print 'Stable' or 'Unstable'.

Constraints

Algorithm name is valid.

Sample Input

Insertion

Sample Output

Stable

Explanation

Insertion sort maintains the relative order of duplicate elements, hence it is stable.

Starter Code

#include <stdio.h>
#include <string.h>

int main() {
    char algo[20];
    if (scanf("%19s", algo) == 1) {
        // Write your code here
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →