本篇論文中，我們設計了一個空間最佳化的演算法來解決雙向鏈結串列中交換配對的問題。每個結點只用了一個指標，在系統穏定之後，在環狀鏈結中會一直存在 個配對，系統收斂所需的期望時間為O(n2)。 In this paper, we design a space optimal self-stabilizing algorithm for alternative matching on synchronous bidirectional uniform rings of any size. Each node keeps a pointer. After the system stabilizes, there are always matching pairs on the ring. The expected time for convergence is O(n2)
