http://www.purebasic.com
https://www.purebasic.fr/english/
Yes, I agree. That will be my next test.User_Russian wrote: Tue Dec 21, 2021 3:52 pmNeed result PB 6.00 C Backend with optimize generated code.
Code: Select all
Dim Nums(lim)
Define StartTime.d = ElapsedMilliseconds()
; Use a basic Sieve of Eratosthenes
...
No. It should be because all the other ones were written this way. Plus, I'm benchmarking the whole process, including memory allocation. However, I doubt it varies much between languages anyway.IceSoft wrote: Tue Dec 21, 2021 5:28 pm I think allocating memory should not part of the measurement.
Better:Code: Select all
Dim Nums(lim) Define StartTime.d = ElapsedMilliseconds() ; Use a basic Sieve of Eratosthenes ...
Yes, I agree. I still love PB even though it's not as fast as some others. I'm very surprised though because it seems much faster to me than my C# programs, but that's not based on statistical facts.blueb wrote: Tue Dec 21, 2021 2:59 pm OgreVorbis... I find this all very interesting.
Results from my desktop computer...
It took 0.578 seconds to complete.
Using assembly version...
It took 0.401 seconds to complete.
As you can see from my profile, I have a faster machine. So hardware is important.
I believe that choosing a language that is easy to use outweighs speed, as long as the result is 'fast enough' to do the job.
My take on this... if you selected a programming language that requires less staff you will save more by lowering your payroll costs than by trying to squeeze every bit of performance by changing languages.
Code: Select all
Dim Nums.a(0)
Define.l i,l, n, m, limit,limitroot,two_n
If OpenConsole()
; Ask for the limit to search, get that input and allocate a Array
Print("Enter limit for this search: ")
limit = Val(Input())
If limit=0
limit=1000000 ;default if zero input
EndIf
Define StartTime.d = ElapsedMilliseconds()
For i=1 To 100
ReDim Nums(limit) ;Initially set all numbers as prime (=0)
limitroot=Sqr(limit)
; Use a basic Sieve of Eratosthenes
; Mark even numbers, except 2 as not prime
n=4
Repeat
nums(n)+1
n=n+2
Until n>limit
;Sieve rest of the numbers
n=3
Repeat
If Nums(n) = 0 ;Find next prime
m = n * n ;All smaller multiples of n already marked so skip
two_n=n+n
;This loop is where the program spends most of its time
Repeat
Nums(m)+1 ;mark multiples of m as not prime
m = m + two_n ;can skip even multiples of m as already marked
Until m>limit
EndIf
n= n+2 ;skip next number which is even
Until n>limitroot
Next
Define EndTime.d = (ElapsedMilliseconds() - StartTime) / 1000.0
PrintN("It took " + StrD(EndTime) + " seconds to complete.")
Print("Press ENTER to list results. . . ") : Input()
PrintN(#CRLF$ + "The primes up to " + Str(limit) + " are:")
m = 0
For n = 2 To limit
If Nums(n) = #False
;PrintN(Str(n))
m = m + 1
EndIf
Next
PrintN(#CRLF$ + "The number of primes up to " + Str(limit) + " is: "+Str(m))
Dim pcount(20)
For i=0 To 9
If i=0
pcount(i)=pcount(i)-2
EndIf
For j=i*limit/10 To i*limit/10+limit/10-1
If Nums(j) = #False
;PrintN(Str(n))
pcount(i)=pcount(i)+1
EndIf
Next
PrintN("Num Primes from "+Str(i*limit/10)+" To " +Str(i*limit/10+limit/10-1)+" is "+Str(pcount(i)))
Next
Print(#CRLF$ + "Press ENTER to exit"): Input()
CloseConsole()
EndIfCode: Select all
Dim Nums.b(0)
Define.l i,m,n
If OpenConsole()
; Ask for the limit to search, get that input and allocate a Array
Print("Enter limit for this search: ")
limit = Val(Input())
If limit=0
limit=1000000 ;default if zero input
EndIf
Define StartTime.d = ElapsedMilliseconds()
For i=1 To 100
ReDim Nums(limit)
limitroot=Sqr(limit)
; Use a basic Sieve of Eratosthenes
;Initialize registers
! MOV rbp,qword [a_Nums]
! MOV r8,qword [v_limitroot]
! MOV r9, qword [v_limit]
;n=4
! MOV r11,4
;Repeat
! _Repeat7:
; nums(n)+1
!MOV byte [rbp+r11],1
; n=n+2
!ADD r11,2
; Until n>limit
!CMP r11,r9
!JLE _Repeat7
;n=3
! MOV r11,3
; Repeat
!_Repeat8:
; If Nums(n) = 0
!MOVSX r15,byte [rbp+r11]
!AND r15,r15
!JNE _EndIfxx
; m = n * n
!MOV r10,R11
!IMUL r10,R11
; two_n=n+n
!MOV r13,r11
!ADD r13,r11
;Note the next loop is where the program spends most of its time
;Repeat
!_Repeat11:
; Nums(m)+1
!MOV byte [rbp+r10],1
;m = m + two_n
!ADD r10,r13
;Until m>limit
!CMP r10,r9
!JLE _Repeat11
; EndIf
!_EndIfxx:
; n= n+2
!add r11,2
; Until n>limitroot
! CMP r11,r8
! JLE _Repeat8
!_Until8:
Next
Define EndTime.d = (ElapsedMilliseconds() - StartTime) / 1000.0
PrintN("It took " + StrD(EndTime) + " seconds to complete.")
Print("Press ENTER to list results. . . ") : Input()
PrintN(#CRLF$ + "The primes up to " + Str(limit) + " are:")
m = 0
For n = 2 To limit
If Nums(n) = #False
;PrintN(Str(n))
m = m + 1
EndIf
Next
PrintN(#CRLF$ + "The number of primes up to " + Str(limit) + " is: "+Str(m))
Dim pcount.l(20)
For i=0 To 9
If i=0
pcount(i)=pcount(i)-2
EndIf
For j=i*limit/10 To i*limit/10+limit/10-1
If Nums(j) = #False
;PrintN(Str(n))
pcount(i)=pcount(i)+1
EndIf
Next
PrintN("Num Primes from "+Str(i*limit/10)+" To " +Str(i*limit/10+limit/10-1)+" is "+Str(pcount(i)))
Next
Print(#CRLF$ + "Press ENTER to exit"): Input()
CloseConsole()
EndIfThe point was to port pb to the new arm based mac. It makes new architectural targets trivial compared to creating new architectural asm output. Case in point: raspberry pi was released at the same time.pfaber11 wrote: Sat Jun 04, 2022 12:17 pm What was the point of the new c backend , will it increase the speed ?