Merge sort [5, 4, 3, 2, 1] #49

Medium 30 pts New · no attempts yet csharp

Topics

Toolliyo edge

Sort [5, 4, 3, 2, 1] ascending; print comma-separated.

Static hints

Merge sort O(n²) or O(n log n)

Toolliyo Coach

Stuck? Get a nudge — not the answer

Progressive help: Nudge → Guide → Approach. Full solution stays behind the Solution tab.

Your solution

Editor is open — no login wall to practice.

Ready — edit the code above and click Run or Submit.

Official solution

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static void Main()
    {
        int[] a = { 5, 4, 3, 2, 1 };
        Array.Sort(a);
        Console.WriteLine(string.Join(",", a));
    }
}

Prefer Coach (Nudge → Guide → Approach) before revealing. No forced signup.

Explanation

Merge sort — implement manually in interviews; Array.Sort for verification.

Prev Next All problems

Merge sort [5, 4, 3, 2, 1] #49

Stuck? Get a nudge — not the answer

Your solution

Official solution

Explanation

Your submissions

Discussion