원형 배열과 슬라이스를 모두 고려하여 Go에서 큐를 효율적으로 구현하려면 어떻게 해야 합니까?

package main

import (
    "fmt"
    "time"
)

// Queue implementation using a circular array
type Queue struct {
    head, tail int
    array      []int
}

func (q *Queue) Enqueue(x int) bool {
    // Check if queue is full
    if (q.tail+1)%len(q.array) == q.head {
        return false
    }

    // Add element to the tail of the queue
    q.array[q.tail] = x
    q.tail = (q.tail + 1) % len(q.array)

    return true
}

func (q *Queue) Dequeue() (int, bool) {
    // Check if queue is empty
    if q.head == q.tail {
        return 0, false
    }

    // Remove element from the head of the queue
    x := q.array[q.head]
    q.head = (q.head + 1) % len(q.array)

    return x, true
}

// Queue implementation using slices
type QueueSlice []int

func (q *QueueSlice) Enqueue(x int) {
    *q = append(*q, x)
}

func (q *QueueSlice) Dequeue() (int, bool) {
    if len(*q) == 0 {
        return 0, false
    }

    x := (*q)[0]
    *q = (*q)[1:]

    return x, true
}

func main() {
    // Performance comparison between the two queue implementations
    loopCount := 10000000
    fmt.Println("Queue using circular array:")
    q1 := &Queue{array: make([]int, loopCount)}
    start := time.Now()
    for i := 0; i < loopCount; i++ {
        q1.Enqueue(i)
    }
    for i := 0; i < loopCount; i++ {
        q1.Dequeue()
    }
    elapsed := time.Since(start)
    fmt.Println(elapsed)

    fmt.Println("\nQueue using slices:")
    q2 := &QueueSlice{}
    start = time.Now()
    for i := 0; i < loopCount; i++ {
        q2.Enqueue(i)
    }
    for i := 0; i < loopCount; i++ {
        q2.Dequeue()
    }
    elapsed = time.Since(start)
    fmt.Println(elapsed)
}