๐Ÿ—‚ Algorithm Classification

graph TD 
0[["โš™๏ธ Algorithm"]] -. x = 1 .-> A["Allocation"]
0[["โš™๏ธ Algorithm"]] -. "f()" .-> B["Instruction"]

B --> BB["Control instruction"]

BB -. void .-> BBA(["Procedure"])
BB -. return .-> BBB(["Function"])

BA -. "for()" .-> BAA(["Iteration"])
BA -. "if()" .-> BAB(["Alternative"])
BA -. "{ }" .-> BAC(["Sequence"])

BBA --> BA["Calling instruction"]
BBB --> BA["Calling instruction"]

class 0 internal-link


โš™๏ธ Algorithm