Skip to question

Q164FreeSystemVerilog

Insertion sort in place

Difficulty
Easy
Topic
Arrays
Language
SV
Interview prompt

Question

Sort a dynamic array of integers in ascending order using insertion sort.

Candidate starting point

Implementation scaffold

function automatic void insertion_sort(ref int values[]);
  // TODO: implement.
endfunction
Reviewed example

Trace one case

Input
values = [5, 1, 4, 2]
Expected output
[1, 2, 4, 5]

Each element is inserted into the already sorted prefix while equal elements retain their order.

What to cover

Requirements

  1. Modify the input array in place.
  2. Keep equal values in their original relative order.
  3. Handle negative values and duplicate values.
Continue practicing
Q1079 · ArraysBubble sort in placeEasyPQ207 · ArraysQuicksort a dynamic arrayMediumP