Scribd
Upload
8 views

COSC 121 Final Review

The document outlines various data structures and algorithms, including maps, iterators, collections interfaces, and sorting algorithms. It covers definitions, methods, and specific types such as heaps, binary search, and different sorting techniques like quicksort and mergesort. Additionally, it discusses Big O notation and growth rates related to these data structures and algorithms.

Uploaded by

ymkbthz5yr
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

COSC 121 Final Review

The document outlines various data structures and algorithms, including maps, iterators, collections interfaces, and sorting algorithms. It covers definitions, methods, and specific types such as heaps, binary search, and different sorting techniques like quicksort and mergesort. Additionally, it discusses Big O notation and growth rates related to these data structures and algorithms.

Uploaded by

ymkbthz5yr
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 49

ToDo

1 Maps
map Drift'by
Tree
Map I
Britta'bsm
Hash
Definitions
Linked
Hash
Map methods

2 Iterator
Definition
Purpose
4 Methods

3 Collections interface

Definitions whatisSetList Queueinterfaces

Collectioninterfaces Data
4 Structures

Toque PriorityQueue
Its Linkedlist

lists
Array
Stack
Set
4HashSet
Linked set
Hash

5 Heaps 31Heap
sort

6 Big O GrowthRates

7 Binary LinearSearch

8 Sorting Algorithms
4 Bubblesort
insertionsort
Selectionsort

9 Goodsortingalgorithms
Quicksort
4 Mergesort

You might also like