LESSON 214 OF 410 · BRUTE FORCE

Sorting: Selection Sort in Java (O(n^2) Time Complexity)

Practice O(n²)

In this video lesson we will learn what sorting is, when it should be used and we will code our first sorting algorithm - Selection Sort:

Problem - Selection Sort:

Given an array of integers nums, sort it in ascending order using Selection Sort

Example 1:

Input: nums = [3, 1, 3, 2, 5, 4]
Output: [1, 2, 3, 3, 4, 5]

Note:

Your algorithm should run in O(n^2) time and use O(1) extra space.

STEP 1 OF 7

Guided

Ctrl + Enter to check