请识别下述代码的编程语言（附算法学习相关代码片段）

Hey there! Let's take a close look at the code you shared:

function Get-Number(n)
    Q ← NIL
    Enqueue(Q,1)
    While n > 0 do
        x ← Dequeue(Q)
        Unique-Enqueue(Q,2x)
        Unique-Enqueue(Q,3x)
        Unique-Enqueue(Q,5x)
        n ← n – 1
    return x
function Unique-Enqueue(Q,x)
    i ← 0
    while i < |Q| ^ Q[i] < x do
        i ← i + 1
    if i < |Q| ^ x = Q[i] then return
    Insert(Q,i,x)

First off, this isn't a specific general-purpose programming language — it's classic algorithm pseudocode. Pseudocode is a simplified, human-readable way to describe algorithm logic without tying it to the strict syntax of any one language. Here's why I say that:

• Uses ← for assignment, a common pseudocode convention to make the "value flows to variable" logic clearer than a regular =
• NIL is a generic placeholder for an empty/null value, instead of language-specific terms like null (Java/C#), None (Python), or $null (PowerShell)
• |Q| uses mathematical notation to represent the length of queue Q, rather than language-specific methods like Q.length() or len(Q)
• The ^ here acts as a logical "AND" operator (not bitwise XOR or exponentiation, which it would be in most languages) — another pseudocode shortcut for readability
• Functions like Enqueue, Dequeue, and Insert are abstract queue operations, focusing on what the code does rather than how a specific language would implement them

As a side note, this pseudocode implements the algorithm to find the nth ugly number (numbers whose prime factors are only 2, 3, and 5) — neat stuff for learning algorithms!

内容的提问来源于stack exchange，提问作者Hon lo