不带数组的Ruby排序代码示例说明

# 定义链表节点类
class Node
  attr_accessor :value, :next_node
  
  def initialize(value)
    @value = value
    @next_node = nil
  end
end

# 定义链表类
class LinkedList
  attr_accessor :head
  
  def initialize
    @head = nil
  end
  
  # 向链表中插入节点
  def insert(value)
    new_node = Node.new(value)
    
    if @head.nil?
      @head = new_node
    else
      current = @head
      while current.next_node
        current = current.next_node
      end
      current.next_node = new_node
    end
  end
  
  # 对链表进行排序
  def sort
    return if @head.nil? || @head.next_node.nil?
    
    sorted = false
    until sorted
      sorted = true
      current = @head
      previous = nil
      
      while current.next_node
        if current.value > current.next_node.value
          sorted = false
          if previous.nil?
            @head = current.next_node
          else
            previous.next_node = current.next_node
          end
          current.next_node = current.next_node.next_node
          previous = current.next_node.nil? ? current : previous
        else
          previous = current
          current = current.next_node
        end
      end
    end
  end
  
  # 打印链表元素
  def print_list
    current = @head
    while current
      puts current.value
      current = current.next_node
    end
  end
end

# 创建链表对象并插入节点
list = LinkedList.new
list.insert(5)
list.insert(3)
list.insert(8)
list.insert(1)

# 对链表进行排序并打印结果
list.sort
list.print_list