Differences

This shows you the differences between two versions of the page.

--- computer_science:programming:algorithm [2021/09/25 05:28] – [Pseudocode] mana
+++ computer_science:programming:algorithm [2021/10/14 03:35] (current) – [Gauss Sum] mana
@@ Line 83: / Line 83: @@
 * ''Do while'' loops will execute at least once, online ''while'' loops
+===== Sequential Search =====
+Data set of N elements: ''13'' ''4'' ''-20'' ''45'' ''112'' ・・・ ''N=10¹³ / 38944''
+Therefore the list will be L<sub>1</sub>, L<sub>2</sub>, L<sub>3</sub>... L<sub>N</sub>
+Target: 45 〇　130 ×
+This is easy for the brain because the brain is made pattern matching.
+<code>
+Step 1 get L1, L2, LN, N, Target
+Step 2 Set Found = No
+Step 3 Set i = 1
+Step 4 while (Foundo = No AND i ≤ N) do Step 5 to Step 6
+Step 5     if (Li = Target) then
+               set Found = Yes
+Step 6     else
+               set i = i + 1
+Step 7 if (Found = Yes) then
+           print "Target found"
+Step 8 else
+           print "Target not found"
+Step 9 stop
+</code>
+===== The Swap =====
+x y
+3
+Swap the content of both variable so that X=3 and Y=5
+<code>
+Step 1 get x, y
+Step 2 set temp = x
+Step 3 x = y
+Step 4 y = temp
+Stop 5 Stop
+</code>
+* For swapping in other algorithm ''swap(x,y)'' can be used instead.
+===== Gauss Sum =====
+n ≥ 1
++2+3+4+...+n
+Formula: $\frac{(n+1)*n}{2}$  $\Theta$
+FIXME (double check this information)
+When talking about efficiency we say that the efficiency of n is $\Theta(n^2)$