Factoring Program Optimizations

Forum Attachments

Summary:

I'm trying to optimize a factoring program of mine so that it can be as small as possible.

Factoring Program Optimizations

Z_dude 10 Apr 2020 18:14

This is a factoring program I made that outputs all of the factor pairs of a number. I've been trying to make it as small as possible, rather than optimizing for speed, but it is still very fast. Any ideas on further optimizations?

:Prompt A
:For (I,1,1+int(√(A)))     //In this case, I know I am losing 3 bytes. This is the only case where I am factoring for speed, since leaving the parentheses here off will slow it down 20x.
:If not(fPart(A/I          //Using remainder( is faster, (I think), but it's a byte more, and I don't care enough about the tiny speed loss.
:Then
:Disp I
:Pause A/I
:End
:End

I'm asking because I don't see any other optimizations. And to think that this used to be 120 bytes!

Re: Factoring Program Optimizations

(account deleted) 10 Apr 2020 19:19

1. Get rid of the extra parenthesis

:Prompt A
:For (I,1,1+int(√(A    //In this case, I know I am losing 3 bytes. This is the only case where I am factoring for speed, since leaving the parentheses here off will slow it down 20x.
:If not(fPart(A/I          //Using remainder( is faster, (I think), but it's a byte more, and I don't care enough about the tiny speed loss.
:Then
:Disp I
:Pause A/I
:End
:End

2. Put the two ends on one line

:Prompt A
:For (I,1,1+int(√(A    //In this case, I know I am losing 3 bytes. This is the only case where I am factoring for speed, since leaving the parentheses here off will slow it down 20x.
:If not(fPart(A/I          //Using remainder( is faster, (I think), but it's a byte more, and I don't care enough about the tiny speed loss.
:Then
:Disp I
:Pause A/I
:End:End

Here is my program I made. It is 37 bytes.

For(B,1,A
If B>√(A
Return
A/B
If Ans=int(Ans
Disp {B,Ans
End

---

Hewwo, my name is Achak Claw. I was formerly BioHazard.

Last edited on 10 Apr 2020 20:46 by (account deleted) Show more

Re: Factoring Program Optimizations

Z_dude 10 Apr 2020 20:22

Oooh. Hadn't even thought of displaying a list, that's pretty smart. And the code to end the program is pretty smart, too. Thanks!
I don't think the parentheses around Ans is necessary, by the way. I believe Ans=int(Ans should work just as well.

Just one question: You said to put both End statements on one line, but as far as I know, that doesn't actually change the number of bytes. You are just replacing the newline token with the colon token. Am I mistaken? I typically shy away from putting multiple lines of code strung together with a colon, since it doesn't optimize anything and it makes the code look messier. The only time I string things onto the same line is for DelVar.

Thanks, though!

Re: Factoring Program Optimizations

(account deleted) 10 Apr 2020 20:47

Now it's 35 bytes.

---

Hewwo, my name is Achak Claw. I was formerly BioHazard.

Re: Factoring Program Optimizations

Trenly 11 Apr 2020 04:14

You can save a few bytes by putting the square root at the top of the for loop rather than having a conditional for it

For(B,1,√(A
A/B
If Ans=int(Ans
Disp {B,Ans
End

Re: Factoring Program Optimizations

TheWordSmither 30 Apr 2020 14:49

I got it further optimized. 1 byte from what I can tell.

For (B,1,√ (A
A/B
If not(fPart(Ans
Disp {B,Ans
End

You can also remove the { for another byte, but it gets messy

Last edited on 30 Apr 2020 15:34 by TheWordSmither Show more

Re: Factoring Program Optimizations

(account deleted) 30 Apr 2020 15:03

You need the End statement at the end, or it won't work. Ans is faster than A when you reference it.
Disp {B,Ans

---

Hewwo, my name is Achak Claw. I was formerly BioHazard.

Re: Factoring Program Optimizations

TheWordSmither 30 Apr 2020 15:33

Thats what I put on my calculator, I'm just terrible at writing. Thanks for the callout