diff --git a/sort/radixsort.go b/sort/radixsort.go
index 7b731cdb1..4dbd21d64 100644
--- a/sort/radixsort.go
+++ b/sort/radixsort.go
@@ -1,10 +1,18 @@
+// radixsort.go
+// description: Implementation of in-place radixsort algorithm
+// details:
+// A simple in-place quicksort algorithm implementation. [Wikipedia](https://en.wikipedia.org/wiki/Radix_sort)
+
 package sort
 
-import "github.com/TheAlgorithms/Go/math/max"
+import (
+	"github.com/TheAlgorithms/Go/constraints"
+	"github.com/TheAlgorithms/Go/math/max"
+)
 
-func countSort(arr []int, exp int) []int {
+func countSort[T constraints.Integer](arr []T, exp T) []T {
 	var digits [10]int
-	var output = make([]int, len(arr))
+	var output = make([]T, len(arr))
 
 	for _, item := range arr {
 		digits[(item/exp)%10]++
@@ -21,22 +29,22 @@ func countSort(arr []int, exp int) []int {
 	return output
 }
 
-func unsignedRadixSort(arr []int) []int {
+func unsignedRadixSort[T constraints.Integer](arr []T) []T {
 	if len(arr) == 0 {
 		return arr
 	}
 	maxElement := max.Int(arr...)
-	for exp := 1; maxElement/exp > 0; exp *= 10 {
+	for exp := T(1); maxElement/exp > 0; exp *= 10 {
 		arr = countSort(arr, exp)
 	}
 	return arr
 }
 
-func RadixSort(arr []int) []int {
+func RadixSort[T constraints.Integer](arr []T) []T {
 	if len(arr) < 1 {
 		return arr
 	}
-	var negatives, nonNegatives []int
+	var negatives, nonNegatives []T
 
 	for _, item := range arr {
 		if item < 0 {
diff --git a/sort/sorts_test.go b/sort/sorts_test.go
index 1c07ddb2b..34f2966e2 100644
--- a/sort/sorts_test.go
+++ b/sort/sorts_test.go
@@ -112,7 +112,7 @@ func TestShell(t *testing.T) {
 }
 
 func TestRadix(t *testing.T) {
-	testFramework(t, sort.RadixSort)
+	testFramework(t, sort.RadixSort[int])
 }
 
 func TestSimple(t *testing.T) {
@@ -217,7 +217,7 @@ func BenchmarkShell(b *testing.B) {
 }
 
 func BenchmarkRadix(b *testing.B) {
-	benchmarkFramework(b, sort.RadixSort)
+	benchmarkFramework(b, sort.RadixSort[int])
 }
 
 func BenchmarkSimple(b *testing.B) {