Commit 368b239

committed

Fix Project Euler problem 3

1 parent 9244e32 commit 368b239Copy full SHA for 368b239

File tree

+11

-28

lines changed

+11

-28

lines changed

Lines changed: 0 additions & 17 deletions

This file was deleted.

Lines changed: 11 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,17 +1,17 @@`
`1`	`1`	`% pfz: returns the prime factorization of that number.`
`2`	`2`	`% assumes: number is positive`
`3`		`-% uses: function isPrime`
`4`	`3`	`function y = pfz(number)`
`5`	`4`	`assert(number >= 0,'number must be positive')`
`6`	`5`	`y = []; % collects all prime factors`
`7`		`- tmp = number; % saves temporary the argument`
`8`		`- for divisor = 2 : 1 : sqrt(number)`
`9`		`- if (isPrime(divisor))`
`10`		`- while (mod(number,divisor) == 0)`
`11`		`- y = [y divisor];`
`12`		`- number = idivide(number,divisor); % integer division`
`13`		`- endwhile`
`14`		`- number = tmp;`
`15`		`- endif`
`16`		`- endfor`
	`6`	`+ divisor = 2;`
	`7`	`+ while (divisor <= sqrt(number))`
	`8`	`+ while (mod(number,divisor) == 0)`
	`9`	`+ y = [y divisor];`
	`10`	`+ number /= divisor; % integer division`
	`11`	`+ endwhile`
	`12`	`+ divisor += 1;`
	`13`	`+ endwhile`
	`14`	`+ if (number > 1)`
	`15`	`+ y = [y number];`
	`16`	`+ endif`
`17`	`17`	`endfunction`

Comments

(0)