From b6e88e78b5d14eab287d039343f1f79223a83c3c Mon Sep 17 00:00:00 2001
From: Gealber <gealbermorales@gmail.com>
Date: Sat, 8 Jun 2024 15:00:57 +0200
Subject: [PATCH] replacing bubble sort algorithm in PeersInfo method, with the
 sort.Slice of the standard library

---
 p2p/server.go | 12 +++++-------
 1 file changed, 5 insertions(+), 7 deletions(-)

diff --git a/p2p/server.go b/p2p/server.go
index 22e5f6cb94..ae53e29707 100644
--- a/p2p/server.go
+++ b/p2p/server.go
@@ -26,6 +26,7 @@ import (
 	"net"
 	"net/netip"
 	"slices"
+	"sort"
 	"sync"
 	"sync/atomic"
 	"time"
@@ -1140,12 +1141,9 @@ func (srv *Server) PeersInfo() []*PeerInfo {
 		}
 	}
 	// Sort the result array alphabetically by node identifier
-	for i := 0; i < len(infos); i++ {
-		for j := i + 1; j < len(infos); j++ {
-			if infos[i].ID > infos[j].ID {
-				infos[i], infos[j] = infos[j], infos[i]
-			}
-		}
-	}
+	sort.Slice(infos, func(i, j int) bool {
+		return infos[i].ID < infos[j].ID
+	})
+
 	return infos
 }