ASSIGNMENT 01:

ALGORITHM DESIGN
NGO THI NGAN HA
BKC191OO
BTEC-C01K11
OUTLINE

I. ALGORITHM

II.IMPLEMENTING ALGORITHMS INTO THE

PROGRAM
 I.
ALGORITHM
 DEFINITION OF
ALGORITHM

• AN ALGORITHM IS A FINITE SET OF WELL-DEFINED INSTRUCTIONS

THAT CAN BE PERFORMED WITH A COMPUTER, OFTEN TO SOLVE A
CLASS OF PROBLEMS OR TO PERFORM A CALCULATION.
ALGORITHMS ARE ALWAYS CLEAR AND USED TO SPECIFY THE
EXECUTION OF CALCULATIONS, DATA PROCESSING, AUTOMATED
INFERENCE, AND OTHER OPERATIONS.
PROPERTIES OF THE
ALGORITHM
Accuracy

Finality Objectivity

Clarity Universalit
y
 EXPRESSION OF THE
ALGORITHM
• 1. HIGH LEVEL DESCRIPTION
• 2. DESCRIPTION OF DEPLOYMENT
• 3. OFFICIAL DESCRIPTION
 BUBBLE
CLASSIFICATION
ALGORITHM
LINEAR SEARCH
ALGORITHM START

arr [n],
END i=0
item

NO
i< n i += 1

YES

YES
arr[i] == NO
item
CODING LINEAR
SEARCH
ALGORITHM
QUICK SORT
ALGORITHM
QUICK SORT
ALGORITHM

Advantages
• High performance
• Easy implementation
Disadvantages
• Unstable
• Heavily decrease in speed in worse cases
QUICK SORT ALGORITHM
QUICK SORT ALGORITHM
CODING QUICK SORT
ALGORITHM
LINEAR SEARCH ALGORITHM

Advantages
• Easy to understand and implement
• No sorting required
• Suitable for small list sizes

Disadvantages
• Time inefficient compared to other algorithms
• Not suitable for large-sized lists
III. BIG-O NOTATION
BIG O NOTATION IS A MATHEMATICAL NOTATION THAT
DESCRIBES THE LIMITING BEHAVIOR OF A FUNCTION WHEN THE
ARGUMENT TENDS TOWARDS A PARTICULAR VALUE OR INFINITY.
BIG-O NOTATION

Big O notation tells you the number of operations an

algorithm will make. It gets its name from the literal "Big
O" in front of the estimated number of operations.
BIG-O NOTATION

f(n) = 3
BIG-O NOTATION

f(n) = 3n + 2
CONTACT US
THANH YOU

FACEBOOK EMAIL PHONE

NGÂN HÀ HANGAN2122001@GMAIL.C 0349685127
OM