DeepSource
Dashboard Resources Pricing Discover Directory Log in

Run your first analysis.

Find thousands of code security and quality issues in your codebase, before they end up in production.

Start now

diptangsu / Sorting-Algorithms

Error compiling SCC-compile
Bug risk
Critical
3 years ago — 4 years old
merge redeclared in this block
Go/timsort.go
30	}
31}
32
33func merge(a []int, left, middle, right int) {34	len1 := middle - left + 1
35	len2 := right - middle
36	begin := make([]int, len1)
undeclared name: fmt
Go/timsort.go
83    a = append(a,x)
84  }
85  TimSort(a)
86  fmt.Println("Sorted array: \n",a)87}
undeclared name: fmt
Go/timsort.go
79  fmt.Scan(&n)
80  fmt.Println("Enter the values one by one: ")
81  for i:=0;i<n;i++ {
82    fmt.Scan(&x)83    a = append(a,x)
84  }
85  TimSort(a)
undeclared name: fmt
Go/timsort.go
77  var x,n int
78  fmt.Println("Enter the number of elements")
79  fmt.Scan(&n)
80  fmt.Println("Enter the values one by one: ")81  for i:=0;i<n;i++ {
82    fmt.Scan(&x)
83    a = append(a,x)
undeclared name: fmt
Go/timsort.go
76  var a []int
77  var x,n int
78  fmt.Println("Enter the number of elements")
79  fmt.Scan(&n)80  fmt.Println("Enter the values one by one: ")
81  for i:=0;i<n;i++ {
82    fmt.Scan(&x)