refactor: replace sort.Slice with slices.Sort for natural ordering (#2768)

<!--
Please read and fill out this form before submitting your PR.

Please make sure you have reviewed our contributors guide before
submitting your
first PR.

NOTE: PR titles should follow semantic commits:
https://www.conventionalcommits.org/en/v1.0.0/
-->

## Overview

There is a [new function](https://pkg.go.dev/slices#Sort) added in the
go1.21 standard library, which can make the code more concise and easy
to read.

<!-- 
Please provide an explanation of the PR, including the appropriate
context,
background, goal, and rationale. If there is an issue with this
information,
please provide a tl;dr and link the issue. 

Ex: Closes #<issue number>
-->

Signed-off-by: suranmiao <solsui@outlook.com>
Co-authored-by: Marko <marko@baricevic.me>

Author: suranmiao

tools/cache-analyzer/main.go

@@ -7,7 +7,7 @@ import (
 	"fmt"
 	"os"
 	"path/filepath"
-	"sort"
+	"slices"
 	"strings"
 
 	"github.com/evstack/ev-node/types"
@@ -114,9 +114,7 @@ func analyzeEvents(events map[uint64]*DAHeightEvent, limit int) []eventEntry {
 	for height := range events {
 		heights = append(heights, height)
 	}
-	sort.Slice(heights, func(i, j int) bool {
-		return heights[i] < heights[j]
-	})
+	slices.Sort(heights)
 
 	// Apply limit
 	if limit > 0 && len(heights) > limit {