I don’t understand how this is possible. I tried it many times, targmin always wins, and by quite a significant margin (1.5.2)

```
using BenchmarkTools
function targmin(a)
m = Inf
ind = 0
for i in 1:length(a)
if a[i] < m
m = a[i]
ind = i
end
end
ind
end
a = rand(10 ^ 8);
println(argmin(a) == targmin(a))
@btime argmin(a)
@btime targmin(a)
```

true

382.492 ms (1 allocation: 16 bytes)

182.026 ms (1 allocation: 16 bytes)