(100_000) for i in 1:100];
62.2334833572072
62X faster
0.535385509/0.000809309 #@time [sumofsins4(100_000) for i in 1:100];
661.5341099629437
661X faster
1 Mayıs 2015 Cuma 19:14:37 UTC-4 tarihinde Kenan KARAGÜL yazdı:
Thank you. Problem solved.
1 Mayıs 2015 Cuma 17:58:35 UTC-4 tarihinde John
Thank you. Problem solved.
1 Mayıs 2015 Cuma 17:58:35 UTC-4 tarihinde John Myles White yazdı:
Re. perf changes: there was a regression since 2013. There's an issue
here: https://github.com/JuliaLang/julia/issues/9942
-- John
On Friday, May 1, 2015 at 12:10:37 PM UTC-7, Kenan KARAGÜL
Hi everybody,
I read an article Writing Type-Stable Code in Julia from John Myles White
in this website:
http://www.johnmyleswhite.com/notebook/2013/12/06/writing-type-stable-code-in-julia/
I have got two different results.
1) GC time is very high, John's has zero.
2) John's run time 50x
Hi everybody,
I am working about integer arrays and I need Int64 NaN.
Have any solutions for this problem?
Thanks in advance.
Kenan
Hi,
This 3 column are neccessary for later analysis in my work, first and
second column index and 3rd values. I have to use three columns same time.
29 Kasım 2014 Cumartesi 13:01:16 UTC-5 tarihinde Jeff Waller yazdı:
I'd add one more.
Or two arrays or a composite with 2 arrays.
After all
, Kenan KARAGÜL kkar...@gmail.com
javascript: wrote:
Hi everyone,
Could you help me any one about this subject.
A=rand(2,3)
2x3 Array{Float64,2}:
0.650875 0.0649599 0.320412
0.801777 0.633312 0.271399
a,b,C=findnz(A)
([1,2,1,2,1,2],[1,1,2,2,3,3
Hi Jeff,
Thank you very much your responses,
I am sorry I didn't understand your answer because I dont know what does it
mean f,g and h.
But I want to get this structure and later I have to get by the 3rd column
decreasing order in this structure. And than I can use 1 st and 2nd columns
