Scribd
Upload
24 views2 pages

Vectors

The document discusses the Vector ADT and an array-based implementation. It describes key Vector operations like elemAtRank, insertAtRank, and removeAtRank. The array-based implementation stores elements in an array and tracks size separately. Operations like elemAtRank are O(1) time while insertAtRank and removeAtRank are O(n) time due to potential shifting of elements. Using the array in a circular fashion can improve worst-case performance of insertion and removal at the beginning to O(1) time.

Uploaded by

Jashwant Raj
Copyright
© Attribution Non-Commercial (BY-NC)
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
24 views2 pages

Vectors

The document discusses the Vector ADT and an array-based implementation. It describes key Vector operations like elemAtRank, insertAtRank, and removeAtRank. The array-based implementation stores elements in an array and tracks size separately. Operations like elemAtRank are O(1) time while insertAtRank and removeAtRank are O(n) time due to potential shifting of elements. Using the array in a circular fashion can improve worst-case performance of insertion and removal at the beginning to O(1) time.

Uploaded by

Jashwant Raj
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 2

Outline and Reading Vectors

The Vector ADT (5.1.1) Array-based implementation (5.1.2)

4/1/2003 9:03 AM

Vectors

4/1/2003 9:03 AM

Vectors

The Vector ADT


The Vector ADT extends the notion of array by storing a sequence of arbitrary objects An element can be accessed, inserted or removed by specifying its rank (number of elements preceding it) An exception is thrown if an incorrect rank is specified (e.g., a negative rank)
4/1/2003 9:03 AM

Applications of Vectors
Main vector operations: elemAtRank(int r): returns the element at rank r without removing it replaceAtRank(int r, Object o): replace the element at rank r with o insertAtRank(int r, Object o): insert a new element o to have rank r removeAtRank(int r): removes the element at rank r Additional operations size() and isEmpty()

Direct applications
Sorted collection of objects (elementary database)

Indirect applications
Auxiliary data structure for algorithms Component of other data structures

Vectors

4/1/2003 9:03 AM

Vectors

Array-based Vector
Use an array V of size N A variable n keeps track of the size of the vector (number of elements stored) Operation elemAtRank(r) is implemented in O(1) time by returning V[r]

Insertion
In operation insertAtRank(r, o), we need to make room for the new element by shifting forward the n r elements V[r], , V[n 1] In the worst case (r = 0), this takes O(n) time V 0 1 2 r r o r
Vectors

n n n
6

V 0 1 2 r n

V 0 1 2 V 0 1 2

4/1/2003 9:03 AM

Vectors

4/1/2003 9:03 AM

Deletion
In operation removeAtRank(r), we need to fill the hole left by the removed element by shifting backward the n r 1 elements V[r + 1], , V[n 1] In the worst case (r = 0), this takes O(n) time V 0 1 2 V 0 1 2 V 0 1 2
4/1/2003 9:03 AM

Performance
In the array based implementation of a Vector
The space used by the data structure is O(n) size, isEmpty, elemAtRank and replaceAtRank run in O(1) time insertAtRank and removeAtRank run in O(n) time

o r r r
Vectors

n n n
7

If we use the array in a circular fashion, insertAtRank(0) and removeAtRank(0) run in O(1) time In an insertAtRank operation, when the array is full, instead of throwing an exception, we can replace the array with a larger one
4/1/2003 9:03 AM Vectors 8

You might also like