BudiBadu Logo

Atrium Tour Sorter

Sorting Easy 0 views
Like15

The technical objective is to reorder a collection of tour badge numbers, provided as an array of integers, into a strictly ascending sequence. This operation transforms raw signup logs into a structured roster that enables docents to manage meeting points, verify inventory, and ensure a predictable visitor flow.

The final output must be a new array containing all original badge numbers, including duplicates for family groups and negative placeholders for gallery closures, arranged from smallest to largest value. The solution must handle various dataset sizes, including single-badge entries and empty collections, while preserving the numerical integrity of every record. This provides a reliable data structure for staging atrium tours and compliance reporting.

Examples

Example 1
Input
nums = [18,4,9,4]
Output
[4,4,9,18]
Explanation

Duplicate family badges remain while the list climbs from lowest to highest.

Example 2
Input
nums = []
Output
[]
Explanation

An empty signup produces an empty roster for the guides.

Example 3
Input
nums = [0,-3,7]
Output
[-3,0,7]
Explanation

Negative placeholders and positive badges appear together in ascending order.

Algorithm Flow

Recommendation Algorithm Flow for Atrium Tour Sorter - Budibadu
Recommendation Algorithm Flow for Atrium Tour Sorter - Budibadu

Best Answers

java
import java.util.*;

class Solution {
    public int[] sort_atrium_badges(int[] nums) {
        int[] sortedArr = nums.clone();
        Arrays.sort(sortedArr);
        return sortedArr;
    }
}