# data[].attributes.body
Five type of sorting

selection sort

insertion sort

bubble sort

merge sort

quick sort.

Two types of searching algorithm

-Linear search

-Binary search

# data[].attributes.body
Type of sorting

1. Selection

2. Insertion

3. Bubble

4. Merge

5. Quick

Searching

1. Binary

2. Linear

# data[].attributes.body
sorting

•selection

•bubble

•quick

•merge

•insertation

searching

•linear

•binary

# data[].attributes.body
Bubble sort is the slowest type of sort

# data[].attributes.body
-binary search

-linear search

-merge sort

-selection sort

-bubble sort

-insertion sort

-quick sort

# data[].attributes.body
1. selection : compare & swap

2. insertion palang

3. bubble : compare sebelah, one by one

4. merge : pecah stay, gabung susun

5. quick : choose pivot

searching

1. linear : random number, one by one

2. binary : sorting number, (1st index+ last index) / 2

# data[].attributes.body
i) Linear search

ii) Binary search

# data[].attributes.body
Sorting

i) selection sort

ii) insertion sort

iii) bubble sort

iv) merge sort

v) quick sort

Searching

i)linear search

ii) binary search

# data[].attributes.body
5 types of sorting

2 types of searching

# data[].attributes.body
Sorting is basically arrange a sequence of datas.There are 5 types of sorting.Selection,insertion,bubble,merge and quick sort.

Searching is finding a target key in a sequence of data. There are 2 types of searching.Linear and non-linear.

# data[].attributes.body
searching

linear search

binary search

# data[].attributes.body
Sorting

1. Bubble sort

2. Selection sort

3. Insertion sort

4. Quick sort

5. Merge sort

Searching

1. Linear search

2. Binary search

# data[].attributes.body
Linear search method

Binary search method

# data[].attributes.body
1.Selection sort

2.Insertion sort

3.Bubble sort

4.Quick sort

5.Merge sort

# data[].attributes.body
ada 5 sorting

insertion sort

merge sort

quick sort

selection sort

bubble sort

# data[].attributes.body
Preorder

Belah kiri dan start dari root

Inorder

Bawah dan start dari kiri sekali

Postorder

Belah kanan dan start dari root

# data[].attributes.body
Tree is a non-linear structure. Binary tree every node can have a maximum of 2 children.Binary Tree Operation have siblings,tree traversal,insert node,delete node ,search node,copy tree

# data[].attributes.body
Preorder , inorder , postorder

# data[].attributes.body
tree - boleh ada banyak children

Binary tree - ada 2 children sahaja

Right tree - kalau nak delete node ambik ganti no yang paling besar

Left tree - kalau nak delte node ganti no yang kecik

# data[].attributes.body
Preoder = sebelum

Inorder = tengah

Postorder = selepas

# data[].attributes.body
-binary tree

-nilai kecik sebelah kiri

-nilai besar sebelah kanan

# data[].attributes.body
-yg faham

Root blh ada 1 ja

Leaf yg ada pada hujung node dn tk ada child bwh dia

-binary tree

Mula hilang duplicate

Lps tu bhgi yg mana kecil kiri yg besar kanan

-traversal tree

preorder sblm

Inorder skrg

Postorder selepas

# data[].attributes.body
1. root : top

2. parent : atleast one child

3. child : got parents

4. leaf : end

5. siblings : 2 or more with same parent

# data[].attributes.body
A binary tree is a tree data structure composed of nodes, each of which has at most, two children, referred to as left and right nodes.

# data[].attributes.headline
Untuk binary tree,anak dia mesti tak boleh lebih daripada 2.

# data[].attributes.subject
Untuk binary tree,anak dia mesti tak boleh lebih daripada 2.

# data[].attributes.body
Untuk tree arrangement,nombor yang lebih kecil daripada root akan dimasukkan panda bahagian kiri,yang lebih besar daripada root akan pergi ke kanan

# data[].attributes.body
preorder - sebelum

inorder - tengah

postorder - selepas

# data[].attributes.body
Tree. Nonlinear. Have node,root,parent,child,sibling,leaf.

Binary tree.Maximum of 2 children. Operations are tree traversal,insert node,delete node.

# data[].attributes.body
preorder , inorder , postorder . 3 ni berlainan arah node

# data[].attributes.body
Saya belajar tentang delete node, insert node, binary tree

# data[].attributes.body
Binary tree

Insert node

Delete node

# data[].attributes.body
binary tree

-root

-left subtree/right subtree

-left child/right child

# data[].attributes.body
Delete node kalau kiri amik besar

Delete node kalau kanan amik kecik

# data[].attributes.body
nilai kecil belah kiri

nilai besar @ sama dengan belah kanan

# data[].attributes.body
Delete at front, insert at back

# data[].attributes.body
Concept of queue is first in first out
Enqueus is insert item
Dequeue is remove item

# data[].attributes.body
i learn for queue is enqueue & dequeue , isempty and isfull

# data[].attributes.headline
Kenal tentang cara masuk item dlm circulars using concept queue

# data[].attributes.subject
Kenal tentang cara masuk item dlm circulars using concept queue

# data[].attributes.body
-queue
-stack
Link list

# data[].attributes.body
we learn about aray and how to convert stack into linklist in queue.

# data[].attributes.body
Implementation of queue
-stack
-Array
-Linked list

# data[].attributes.body
I learn about queue, that can be used with array, linked list and stack, btw today i can spell queue correctly

# data[].attributes.body
FIRST IN FIRST OUT

# data[].attributes.body
I learn about queue and circular queue

# data[].attributes.body
Understand queue , how to draw

# data[].attributes.body
I learn about Queue , how to Dequeu and Enqueu

# data[].attributes.body
delete at the front
insert at the back

# data[].attributes.body
Queue in stack
Queue in linked list
Queue in circular list

# data[].attributes.body
We can do 3 implementation using queue. The implementation is stack, stack, and linked list

# data[].attributes.body
i understand that queue use front to delete and rear to insert

# data[].attributes.body
Rear +1

Delete data

Front +1

# data[].attributes.body
Queue is a typical waiting line. Can access both ends. Add at the back and delete at the front. Using concept FIFO. Can implement using array,stack and linked list.

# data[].attributes.body
- first in first out(item)
-enqueue(insert)(f)
-dequeue(delete)(r-last or after last)
-implementation(array,stack,linked list)

# data[].attributes.body
i learn that queue has 4 operation:
Enqueue
Dequeue
isFull
isEmpty

Can be do in Array, Linked List, and Stack

# data[].attributes.body
Stack basically is we put things on top that apply concept LIFO(Last In First Out). It have 5 operations and there are two potential problems might occur.

# data[].attributes.body
I learned about protcol in LIFO

# data[].attributes.body
I get knowledge about linked list and I can draw stack with correct.

# data[].attributes.body
operation of linked list
1. create node
2.create linked list
3.check linked list
4.insert node in the list
5.delete node in the list

# data[].attributes.body
There is list and linked list. list have 4 operations while linked list have 5 operations. There are differences between the two and linked list have types.

# data[].attributes.body
I learned about operation in linked list and list, the difference between them and type of linked list

# data[].attributes.body
push = masuk
pop = buang

# data[].attributes.body
Ada array stack dan linked list stack utk array ada size dan list xde size

# data[].attributes.body
Saya bljr tentang Stack, LIFO dan Top , Push Pop

# data[].attributes.headline
belajar list, linear linked list, singly linked list, doubly linked list, circular linked list, doubly circular linked list

# data[].attributes.subject
belajar list, linear linked list, singly linked list, doubly linked list, circular linked list, doubly circular linked list

# data[].attributes.body
Insertion,deletion,traversal, retrieval

# data[].attributes.body
i learn how to differentiate push (insert) , pop (delete) , top (atas), isempty (kosong) and isfull (penuh)

# data[].attributes.headline
Ada insert , delete, retrieval dan traversal

# data[].attributes.subject
Ada insert , delete, retrieval dan traversal

# data[].attributes.headline
Saya bljr tentang list and linked list dan node dan head , null

# data[].attributes.subject
Saya bljr tentang list and linked list dan node dan head , null

# data[].attributes.body
I learn about what data structures and what example it

# data[].attributes.body
I learn about what data structures and what example it

# data[].attributes.body
Array ,Type of structure ,Type of data structure

# data[].attributes.headline
Learn about type of data structures and how to write data structures 

# data[].attributes.subject
Learn about type of data structures and how to write data structures 

# data[].attributes.body
I learn about struct name , data member, and object/ structure variable

# data[].attributes.headline
I have learn how to get the different between three structure, include:

# data[].attributes.subject
I have learn how to get the different between three structure, include:

# data[].attributes.body
Structure name.
Structure member.
Variable structure.

# data[].attributes.body
Yang I pelajar dalam topik satu ialah data structure is a organising data in a computer.Data structure have 6 data type it is static, dynamic, linear, non linear, primitive, non primitive.That have 5 example of data structures it is array, stack, tree, queue, linked list

# data[].attributes.body
- data structure is a way of storing and organising data in computer.
- 3 types of data structure: linear/non-linear, primitive/non-primitive, static/dynamic.
- examples of data structure: array,linked list,stack,tree
- array store data collection of same variable

# data[].attributes.body
I learn definition of data structure, example of structure and types of structure

# data[].attributes.body
there are 6 types of data structure :

1. linear - straight line
2. non-linear - multi-leveled
3. static - fixed size
4. dynamic - not fixed size
5. primitive - single value
6. non-primitive - groups of values

# data[].attributes.body
i learn how to differentiate 6types of data structure which is linear, non-linear, primitive, non-primitive, static and dynamic.

# data[].attributes.body
Data structure show ways to store and organise data to use it more efficiently.
Also learn about the types of data structure like static vs dynamic, linear and nonlinear, primitive and no primitive.Moreover learn the example of data structure that is array.

# data[].attributes.body
I learned about type and examples of data structure. I also learned on how to do declaration for array

# data[].attributes.body
Saya belajar pasal data structure ada 5 contoh iaitu array,link listed,tree,queue anda stack