data structure

COMP2521 Data Structures & Algorithms Week 7.3 Minimum Spanning Trees 1 In this lecture Why? We need efficient ways to generate minimum spanning trees from a graph What? Minimum Spanning Trees Kruskal’s Algorithm Prim’s Algorithm 2 Minimum Spanning Tree Spanning Tree (ST) of a graph G = (V, E): Contains all vertices (spanning) Contains no […]

COMP2521 Data Structures & Algorithms Week 8.4 Quicksort   1 In this lecture Why? We need to learn about n*log(n) time algorithms for a sorting algorithm suitable for large data sets What? Quick Sort 2 Quicksort General idea: 1. Choose an item to be a “pivot” 2. Re-arrange (partition) the array such that: 1. All

COMP2521 Data Structures & Algorithms Week 8.1 Sorting Overview   1 In this lecture Why? Sorting elements can help us speed up searching, and arranges data in a useful way (for both humans and computers) What? Overview of sorting 2 Sorting Sorting refers to arranging a collection of items in order. E.G. Sorting arrays, linked

COMP2521 Data Structures & Algorithms Week 1.4 Recursion 1 In this lecture Why? While you don’t need recursion to solve a number of problems, its a programming technique that can substantially simplify your source code What? Recursion   2 Recursion Recursion is a programming pattern where a function calls itself. Typically, this happens during some

COMP2521 Data Structures & Algorithms Week 7.2 Directed & Weighted Graphs   1 In this lecture Why? In the real world graph, edges often have a sense of direction, and also a sense of cost to traverse. What? Directed Graphs Weighted graphs   2 A more common graph Often, graphs don’t look like the one

COMP2521 Data Structures & Algorithms Week 9.1 Heaps & Priority Queues   1 In this lecture Why? Heap structures are tree-like structures used for things like priority queues – which are really common What? Heaps Heap insert and delete Priority Queues 2 Heaps Heaps can be conceptualised as dense tree structures where: Tree maintains a

COMP2521 Data Structures & Algorithms Week 3.1 Trees & Binary Search Trees 1 In this lecture Why? To understand the what, how, and why of what binary tree data structures are, as they are a fundamental set of data structure + algorithms for efficient programs What? Trees Binary Search Trees (BST) Operations on BSTs Representing

COMP2521 Data Structures & Algorithms Week 7.1 P, NP   1 In this lecture Why? We want to be able to generalise different categories of algorithms to understand how feasible they are to solve for a given problem. What? P NP NP-Complete   2 Solving vs Verifying When it comes to problems we have to