```python
import heapq

def heap_assending(nums):
    """
    Sorts a given list of elements in ascending order using the heap queue algorithm.
    """
    # Create a min-heap from a copy of the input list to avoid modifying the original.
    min_heap = list(nums)
    heapq.heapify(min_heap)

    # Build the sorted list by repeatedly extracting the smallest element.
    sorted_list = []
    while min_heap:
        smallest_element = heapq.heappop(min_heap)
        sorted_list.append(smallest_element)

    return sorted_list
```