Un-optimized remove dups

removeDupsAlt.go

func removeDupsAlt(arr []int) []int {
	h := make(map[int]bool)

	//O(n) time complexity
	for i := 0; i < len(arr); i++ {
		h[arr[i]] = true
	}
	//O(n) space complexity
	keys := make([]int, len(h))

	i := 0
	//O(n) time complexity
	for k := range h {
		keys[i] = k
		i++
	}
	//O(nlogn) time complexity
	return quickSort(keys)

}