array list implementation · List Unsorted set Sorted set Priority queue Graphs Lists are...

Introduction

Abstract data types:interfaces

Unsorted set

Sorted set

Priority queue

Graphs

Lists arefundamental

Definitions

List operations

List implemen-tationdemands

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

An actual im-plementation

List abstract data type andan “array list” implementation

Comp Sci 1575 Data Structures

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Data Structures...

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Reminder

• Welcome to the first day of Data Structures.

• Now is when it will start to be very helpful to have readthe book chapter. The slides, book, and code will paralleleach other.

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Outline

1 IntroductionAbstract data types: interfaces

ListUnsorted setSorted setPriority queueGraphs

2 Lists are fundamentalDefinitionsList operations

3 List implementation demandsArrays as lists?Current positionExample tasks

IterateSearchInsert

4 An actual implementation

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Outline

IterateSearchInsert

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Interfaces

• List

• Unsorted set (USet)

• Sorted set (SSet)

• Priority queue /

• Graph

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

List implementations

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Unsorted set implementations

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Sorted set implementations

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Priority queue implementations

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Graph implementations

• Adjacency matrix

• Adjacency list (array and linked)

• Incidence list

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Big picture on ADTs

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Chapter dependencies in ODS

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Outline

IterateSearchInsert

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

List ADT: Why do we care?

• A list is the most universal user interface for computers:e.g., Bash’s $ls, your inbox, your google results, your filebrowser, etc.

• MANY programs use lists in at least some part of theirback-end

• What is the common-language definition of a list?

• What is our formal definition of a list ADT?

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Outline

IterateSearchInsert

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Definitions: List ADT

• A list is a finite, ordered sequence of data items.

• List elements have a position or order.

• Ordered is not the same as sorted, which relates order tovalue; lists can be sorted or unsorted, but are still ordered

• Notation: < a0, a1, . . . , an−1 >

• Length/Size of the list is n − 1

• Position of element ai in the list is i

• First element of the list is a0, the head

• Last element is an−1, the tail

• ai follows (or succeeds) ai−1 where (i < n)

• ai−1 precedes ai where (i > 0).

• Each list item has a data type

• Operations??

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Outline

IterateSearchInsert

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Which list ADT operations do we want?

• Should be able to be ordered, and have a position

• Should grow and shrink as we add/insert or remove items

• Should be able to insert and remove elements fromanywhere in the list.

• Should be able to gain access to any element’s value,either to read it or to change it.

• Should be able to create and clear (or reinitialize) lists.

• Convenient to access next or previous element from“current” one.

• Should be able to locate and/or read items by value orposition

• Can have many more arbitrary actions if desired

Check out the pure virtual abstract class, list.h

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Outline

IterateSearchInsert

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Outline

IterateSearchInsert

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

How can we accomplish operation implementation?

What about normal arrays? Aren’t they already complete lists?

i n t x [ 4 ] = {1 , 5 , 8 , 2} ;x [ 0 ] = 3 ;x [ 1 ] = 3 ;x [ 2 ] = 3 ;x [ 3 ] = 3 ;

• Ordered?

• What about search, insert, remove, grow, shrink, next,previous, length, print whole list, append, pop?

To increase our degree of modularity in operation betweenfunctions, which construct is very helpful to keep track of tocomplete many of the above tasks?

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Outline

IterateSearchInsert

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Current position construct is helpful to implement

• Most operations can be made to act relative to a currentposition or a specified position (which could be set tocurrent to complete a task)

• The in-class implementation will support a currentposition, illustrated here using notation | ,e.g.,< 20, 23, |12, 15 >

• For example, listObject.insert(x) could produce< 20, 23, x , |12, 15 >

• This is not true for std:: implementations we’ll cover

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Outline

IterateSearchInsert

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Iterate through a list

One very common task is to iterate through a list:

f o r ( L . mvToStart ( ) ; L . c u r r P o s ( ) < L . l e n g t h ( ) ; L . n e x t ( ) ){

e l e m v a l u e = L . g e t V a l u e ( ) ;doSomething ( e l e m v a l u e ) ;

Note the use of member functions to move through the lits andcheck termintation; note that this function does not use privatemembers.

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

List find function

// r e t u r n True i f k i s i n l i s t L , f a l s e o t h e rw i s e

bool f i n d ( L i s t <i n t> &L , i n t K){

i n t i t ;f o r ( L . mvToStart ( ) ; L . c u r r P o s ( ) < L . l e n g t h ( ) ; L . n e x t ( ) ){

i t = L . g e t V a l u e ( ) ;i f (K == i t )

re tu rn t rue ;}re tu rn f a l s e ; // K not found

What would a better find function return?Can we provide more information?

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Array list insert

• Requires moving elements after insert toward the tail

• How many steps does this take for a list of 4?How about 5? 6? 7?

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

Outline

IterateSearchInsert

Introduction

Unsorted set

Sorted set

Priority queue

Graphs

Definitions

List operations

Arrays as lists?

Current position

Example tasks

Iterate

Search

Insert

“Array list” implementation

List based on arrays:

• Check out abstract class file, list.h

• Go over array list class file, list A.h

• Check out find and print in ListTest.h

• Which is all called in main AList easy .cpp

array list implementation · List Unsorted set Sorted set Priority queue Graphs Lists are...

Documents

Transcript of array list implementation · List Unsorted set Sorted set Priority queue Graphs Lists are...

LIST OF LISTS - epa.gov

Chapter 6 Lists Modified. Chapter Scope Types of lists Using lists to solve problems Various list implementations Comparing list implementations 6 - 2Java.

Insertion Sort - cs.princeton.edu · Insertion Sort With Lists The algorithm is similar, except instead of one array, we will maintain two lists, a sorted list and an unsorted list

BRACSIP - Parliament of Victoria · Table 2. Unsorted Waste and Scrap Paper Increased 2014 – 2019 . YEAR yearly increase unsorted scrap paper import (times) fraction unsorted scrap

Lec-6 List ADT & Linked Lists

Unsorted Lists

BIBLIOGRAPHY FOR THE LIST OF LISTS [04/01/2012]s3.amazonaws.com/.../files/2012/08/Bibliography-for-the-List-of-Lists… · BIBLIOGRAPHY FOR THE LIST OF LISTS [04/01/2012] ANNUALS:

Analyzing Complexity of Lists OperationSorted Array Sorted Linked List Unsorted Array Unsorted Linked List Search( L, x ) O(logn) O( n ) O( n ) Insert(

Unsorted - Blue Frost

Master List of all Interchangeable Lists

Lists CSC 358/458 4.3.2006. Outline Lab #1 / Homework #1 Lists A question List Internals of Lists List operations Extended Example.

Ordered Lists and Sorted Lists Chapter 7. Ordered Lists Array version vs. Linked-list version.

Barron 1215 Unsorted

ANSI Common Lisp 3. Lists 20 June 2003. Lists Conses List Functions Trees Sets Stacks Dotted Lists Assoc-lists.

Lists CS 3358. Outline Abstract Data Type (ADT) List ADT List ADT with Array Implementation Linked lists Basic operations of linked lists Insert, find,

Methods for Search...Lists: sorted and unsorted Sequential search (unsorted list) Binary search (sorted list) Reminders Self-organizing lists Problem Solutions Count Move-to-front

Unified Lists List (B) List of hazardous substances subject to ... - Toxic...Online Training Protocols and Conventions Internet Resources Unified Lists List (B) List of hazardous substances

Chapter 3 ADTs unsorted List and Sorted List. 3-2 List Definitions Linear relationship Each element except the first has a unique predecessor, and each.

ML Lists.1 Standard ML Lists. ML Lists.2 Lists A list is a finite sequence of elements. [3,5,9] ["a", "list" ] [] Elements may appear more than once [3,4]

Chapter 15 Lists. Chapter Scope Types of list collections Using lists to solve problems Various list implementations Comparing list implementations Java.