computer_science:programming:algorithm
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
computer_science:programming:algorithm [2021/09/25 20:39] – [Sequential Search] mana | computer_science:programming:algorithm [2021/10/14 03:35] (current) – [Gauss Sum] mana | ||
---|---|---|---|
Line 105: | Line 105: | ||
Step 9 stop | Step 9 stop | ||
</ | </ | ||
+ | |||
+ | ===== The Swap ===== | ||
+ | x y | ||
+ | 5 3 | ||
+ | Swap the content of both variable so that X=3 and Y=5 | ||
+ | < | ||
+ | Step 1 get x, y | ||
+ | Step 2 set temp = x | ||
+ | Step 3 x = y | ||
+ | Step 4 y = temp | ||
+ | Stop 5 Stop | ||
+ | </ | ||
+ | |||
+ | * For swapping in other algorithm '' | ||
+ | |||
+ | ===== Gauss Sum ===== | ||
+ | n ≥ 1 | ||
+ | 1+2+3+4+...+n | ||
+ | |||
+ | Formula: $\frac{(n+1)*n}{2}$ | ||
+ | FIXME (double check this information) | ||
+ | When talking about efficiency we say that the efficiency of n is $\Theta(n^2)$ | ||
+ |
computer_science/programming/algorithm.1632569941.txt.gz · Last modified: 2021/09/25 20:39 by mana