what is the basics of coding – learnwithmeblog

Basic coding

• Complexity: 

• The complexity of an algorithm is a function f(n) which measures the time and space used by an algorithm in terms of input size n.

• The complexity of an algorithm is a way to classify how efficient an algorithm is compared to alternative ones.

• The focus is on how execution time increases with the data set to be processed.

• Time complexity:

The time complexity of an algorithm is the amount of time taken by the algorithm to complete its process as a function of its input length n 

• Space complexity:

Whenever a solution to a problem is written some memory is required to complete. For any algorithm memory may be used for the following: –

• Variable (this includes the constant values, temporary values)

• Program instruction

• Execution

• Auxiliary space 

It is an extra space or the temporary space used by the algorithm during its execution

(Space complexity=auxiliary space + input space)

• While executing, the algorithm uses memory space for three reasons 

• Instruction space 

• Environment stack

• Dataspace

• Raptor/flowchart

Diagrammatic or pictorial representation of an algorithm

Raptor is a flowchart-based on programming environment, designed specifically to help students visualize their algorithms and avoid syntactic baggage 

• Symbols in raptor

Raptor has 6 types of symbols, each of which represents a unique kind of instruction.

 

Shapes	instruction
	Start / end
	Input/output
	arrow
	assignment
	Selection / condition
	Loop