feat: add ToSorted function to return a sorted copy of a slice

[KylinDC]

Add a function to return a sorted copy of a slice. Tests also added.
Feel free to comment.

[kqvanity]

I'm wondering why it hasn't merged or discusses even. The current plain go implementation requires a separate sort package interfaces. related

[ccoVeille]

I would have used "Sort"

Suggested change

	// ToSorted return a sorted copy of a slice
	// Play: https://go.dev/play/p/G4-aR2Yxh3M
	func ToSorted[T constraints.Ordered](collection []T) []T {
	if collection == nil {
	return nil
	}
	copied := make([]T, len(collection))
	copy(copied, collection)
	slices.Sort(copied)
	return copied
	}
	// Sort return a sorted copy of a slice
	// Play: https://go.dev/play/p/G4-aR2Yxh3M
	func Sort[T constraints.Ordered](collection []T) []T {
	if collection == nil {
	return nil
	}
	copied := make([]T, len(collection))
	copy(copied, collection)
	slices.Sort(copied)
	return copied
	}

[ccoVeille]

Suggested change

	- [ToSorted](#tosorted)
	- [Sort](#sort)

[ccoVeille]

Suggested change

	### ToSorted
	Return a sorted copy of a slice.
	```go
	sorted := lo.ToSorted([]int{0, 1, 4, 3, 2})
	// [0 1 2 3 4]
	```
	[[play](https://go.dev/play/p/G4-aR2Yxh3M)]
	### Sort
	Return a sorted copy of a slice.
	```go
	sorted := lo.Sort([]int{0, 1, 4, 3, 2})
	// [0 1 2 3 4]
	```
	[[play](https://go.dev/play/p/G4-aR2Yxh3M)]