CS136 Lecture Notes - Lecture 24: Quicksort, C String Handling, Memory Management

101 views2 pages

17 Apr 2018

School

Department

Course

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

Tuesday, April 3, 2018

Lec 24

CS136

- Void pointers

• Any type

• Just memory address

• Cannot be directly dereferenced

- Implementing ADTs with void pointers

• Memory management

- Client or ADT is responsible for freeing item data

• Comparisons

- Some ADTs must be able to compare items when searching and sorting

1 University of Waterloo, CS 136 Winter 2018, 12-Abstract_data_types, p18, Snapshotted by

author

Unlock document

This preview shows half of the first page of the document.
Unlock all 2 pages and 3 million more documents.

Already have an account? Log in

Get access