(n int)
| 9 | ) |
| 10 | |
| 11 | func GetArrayOfSize(n int) []int { |
| 12 | p, err := build.Default.Import("github.com/arnauddri/algorithms/algorithms/sorting/utils", "", build.FindOnly) |
| 13 | |
| 14 | if err != nil { |
| 15 | // handle error |
| 16 | } |
| 17 | fname := filepath.Join(p.Dir, "IntegerArray.txt") |
| 18 | f, _ := os.Open(fname) |
| 19 | defer f.Close() |
| 20 | |
| 21 | numbers := make([]int, 0) |
| 22 | scanner := bufio.NewScanner(f) |
| 23 | |
| 24 | for scanner.Scan() { |
| 25 | s, _ := strconv.Atoi(scanner.Text()) |
| 26 | numbers = append(numbers, s) |
| 27 | } |
| 28 | |
| 29 | return numbers[0:n] |
| 30 | } |