پاورپوینت ساختمان داده‌ها و الگوریتم در 385 اسلاید بسیار جامع شامل بخش های زیر می باشد:
در مورد ساختمان داده
Perequisites
Sorting
Sort metods
Insert An Element
Insertion sort
Complexityیا پیچیدگی
Compration count
شمارش مقایسه ای
Compration count
Worst-case Compration count
Step count
محاسبه پیچیدگی در مرتب سازی درجی
ساختمان داده Data Structure
Data object
Linear (or Ordered) lists
مثالهایی از لیست های خطی
Linear list Oprations-remove(the index)
Liner List Abstaract Data Type
Liner List Abstaract Data Type
Liner List Abstaract Data Type
Linked Representation
Node Representation
The Method isEmpty
The Method size()
Chain With Header Node
Empty Chain With Header Node
Arrays
Columns Of A 2D Array
Column-Major Mapping
Sparse Matrices
Representation Of Unstructured Sparse Matrices
Single Linear List Example
One Linear List Per Row
Orthogonal List Representation
Row Lists
Column Lists
Orthogonal Lists
Stacks
Stack Of Cups
The Interface Stack
Example
Derive From A Linear List Class
Derive From ArrayLinearList
Derive From Chain
empty And peek
push(theObject) And pop
A Faster pop
Queues
Bus Stop Queue
The Interface Queue
Custom Array Queue
Remove An Element
Empty That Queue
A Full Tank Please
Ouch
Nature Lover’s View Of A Tree
Computer Scientist’s View
Hierarchical Data And Trees
Classes (Part Of Figure 1.1)
Definition
Subtrees
Leaves
Caution
height = depth = number of levels
Binary Tree
Operator Degree
Infix Form
Operator Priorities
Postfix Form
Unary Operators
Postfix Evaluation
Binary Tree Form
Merits Of Binary Tree Form
Minimum Number Of Nodes
Node Number Properties
Complete Binary Tree With n Nodes
Array Representation
Linked Representation
The Class BinaryTreeNode
Binary Tree Traversal Methods
Preorder Of Expression Tree
Inorder Traversal
Postorder Traversal
Postorder Of Expression Tree
Level Order
Preorder And Postorder
Inorder And Preorder
Inorder And Level Order
Min Priority Queue
Max Priority Queue
Complexity Of Operations
Applications
Sorting Example
Complexity Of Sorting
Heap Sort
Min Tree Definition
Max Tree Example
Min Heap With 9 Nodes
Putting An Element Into A Max Heap
Complexity Of Put
Removing The Max Element
Removing The Max Element
Initializing A Max Heap
Complexity
An Extended Binary Tree
Example Binary Search Tree
get(index) And remove(index)
در مورد ساختمان داده
ترتیب زیر را در نظر بگیرید:
a[0],a[1],…, a[n-1]
پس از مرتب سازی صعودی داریم:
a[0] <=a[1] <= ….<=a[n-1]
example:8,6,9,4,3 => 3,4,6,8,9
Sort metods
Insertion sort
Bubble sort
Selection sort
Count sort
Shaker sort
Shell sort
Heap sort
Merge sort
Quick sort
اضافه کردن یکinsert an element
لیست ترتیبی زیر را در نظر بگیرید:
input: 3, 6, 9, 14
عنصر 5 را به لیست فوق اضافه کنید.
output: 3, 5, 6, 9, 14
Insert An Element
3, 6, 9, 14 insert 5
عدد 5 را با آخرین عنصر لیست مقایسه کنید .
Shift 14 right to get 3, 6, 9, , 14
Shift 9 right to get 3, 6, , 9, 14
Shift 6 right to get 3, , 6, 9, 14
با اضافه کردن 5 خروجی:
Output: 3, 5, 6, 9, 14
// insert into a[0:i-1]
Int j;
For (j=i-1 ; j>=0 && t <a[ j] ;j--)
A[ j+1] = a[ j]
A[ j+1] = t ;
Insertion sort
Sort 7, 3, 5, 6, 1
Start with 7 and insert 3=> 3,7
Insert 5=>3, 5, 7
Insert 6=>3, 5, 6, 7
Insert 1=>1, 3, 5, 6, 7
For (i=1 ; i<a.length ; i++)
{// insert a[i] into a[0:i-1]
//code to insert comes here.....
}
دانلود پاورپوینت ساختمان داده‌ها و الگوریتم