AnnouncementsHW6 due this Wednesday

Output of Sample Run 1:2000 2009 Konya Turkey2000 2009 Tuzla Turkey2000 2009 Istanbul Turkey

Name of output file in Sample Run 3:2000_2002_Turkey.txt

HW7 will be assigned this week and will be due January 6th Wednesday (last week)

You may see your Midterm2 papers on Thursday, 12:30 – 14:30 in FENS L068 (Office Hour Room).

Please complete the Course EvaluationsBAGEM should have sent a message about this

Announcements about HW6You may need to use clear() member function

before you try to reopen an input file stream object that you failed to open previously (for example due to wrong file

name), orthat you opened and processed but for some reason if the error

flags are set (for example due to reaching the end of the file).

Possible reasons for run time errors in this homeworkAttempting to read from a file that has not been opened yetAttempting to write to a file that has not been opened yetRange and index problems while trying to access characters of a

string using find, substr and at member functions.

Announcements about HW6 “Should we check if the output file is opened successfully or not?”

Not required, but advised There might be some cases that the output files are not opened

successfully If you check and the output file is not opened, then do not continue with

the program. What happens if the files are opened but the content is irrelevant? What happens if the file names are entered in the wrong order? What happens if both file names are the same? All of these questions are reduced into the same main question:

should we make the content check for the files that are opened successfully? NO. As mentioned in the HW document, the content of the files are

assumed to be correct. What you have to do is only to check if the files are opened successfully or not and continue to read file names until opened. Once opened, we assume that the first file is the business database, and the second one is the distance database files.

ExampleCounting letters of a file

display number of occurrences of each letter at the end

counting is case insensitivesee letters.cpp (the one in book is a bit different)

tvector as a return typeVector can be return type of a function

tvector<int> Count (istream & input, int & total);

Example: modify letters.cpp such that count returns the vector (not as reference parameter)see letters2.cpp

Vectors of structsWe can define vectors of structs

struct student{unsigned int id; string name, lastname;double gpa;

};

tvector<student> class(11); // a vector with 11 students

class[1].gpa = 3.2;

for (i = 0; i <= 10; i++) class[i].id = i + 1250;

1250

id gpa

name

lastname

1251

id3.2

gpa

name

lastname

1260

id gpa

name

lastname

0

1

10

Vector of structExample

define a struct for a track on a CDtrack number and title are fields

define a vector for 10 tracksshuffle these 10 tracks at randomsee shuffle.cpp (in book, but this version is slightly

modified)

Vectors as listsThe “vector as counters” example constructs and

initializes a vector with a specific number of elements

Other uses of vector require the vector to “grow” to accommodate new elementsConsider reading words from a text file, storing them

in a vectorHow big should we define vector initially? What are

potential problems?When a vector is used as a list, we’ll use a different

method for adding elements to the vector so that the vector can “grow”

Reading words into a vector (problematic version) tvector<string> words(1000); string w; int i = 0; string filename = PromptString("enter file name: "); ifstream input(filename.c_str());

while (input >> w) { words[i]=w;

i++; } cout << "read " << i << " words" << endl;

What is the problem?there might be more than 1000 words in the filein this case index runs out of range

Reading words into a vector (with index range control but still problematic)

tvector<string> words(1000); string w; int i = 0; string filename = PromptString("enter file name: "); ifstream input(filename.c_str());

while ((input >> w) && (i < 1000)) { words[i]=w;

i++; } cout << "read " << i << " words" << endl;

What is the problem?works fine if there are no more than 1000 wordsbut if there are more than 1000 words, the rest is not read

Reading words into a vector (no problems)One method would be to pass over the file two times

one to find out number of wordssecond to read the words into array

Another method is to benefit from tvector class utilities as in the following code

tvector<string> words; //create empty vector string w; string filename = PromptString("enter file name: "); ifstream input(filename.c_str());

while (input >> w) { words.push_back(w); //adds the next word to the vector //also increases the size if necessary

} cout << "read " << words.size() << " words" << endl;

Using tvector::push_backThe method push_back adds new objects to the “end” of

a vector,Internally, the vector keeps track of its capacityIf there is capacity, then there is no problem; the new item is added

to the end of the vectorWhen the capacity is reached and push_back attempts to add a

new element to the vector, then the vector automatically “grows” by doubling the capacity 0, 2, 4, 8, 16, 32, ...

If you want to use push_back mechanism, then the vector should be defined initially without specifying a sizeempty vector (zero size)

Size versus CapacityCapacity is the allocated size of the vectorSize is how many elements are in the vector so farThey are not the same concepts, but related as

described in the previous slide and illustrated below

tvector<string> names; // size is 0, capacity is 0

names.push_back("Ali"); // size is 1, capacity is 2

names.push_back("Husnu"); // size is 2, capacity is 2

names.push_back("Ayse"); // size is 3, capacity is 4

names.push_back("Cem"); // size is 4, capacity is 4

names.push_back("Jale"); // size is 5, capacity is 8

size()member function size() member function basically returns the number of

elements in the vector When a vector is defined with no initial capacity, and push_back is used to add elements, size() member function returns the number of elements exist in the vectorThis is the number of calls of push_back() if no elements are deletedIf elements deleted using pop_back(), size updated too

(decremented)If a non-empty vector is created, then the capacity and the

size is set to the number of elements of the vector. This capacity is considered full, so the first push_back causes to double the capacity.

What about size() in case the vector is created as a non-empty onereturns the size specified during declaration if no push_back() is

usedreturns the size specified during declaration + the number push_back()s, if push_back() is used

capacity()and reserve()The capacity of vector is accessible using capacity() member functionprogrammers don’t often need this value

An initial capacity of N elements can be specified using reserve(N) member function

Demo ExampleRead some strings from keyboard and store in a

tvector of strings. At the end display the vector.version 1: no reserveversion 2: (decomment the reserve lines): with

reserveversion 3: vector is not created empty (decomment

second definition and comment out first one and reserve lines)

See tvectordemo.cpp (not in the book)

Vector Processing Examples – 1 (vectorproc.cpp – not in book) write a function that takes a tvector of integers as parameter and

returns the maximum of numbers in it process all array elements – for loop from 0 to vector’s size - 1

int max (const tvector<int> & v)//pre: vector v is not empty//post: return max of elements in v{

int i, max_so_far = INT_MIN;

for (i=0; i < v.size(); i++){

if (v[i] > max_so_far){

max_so_far = v[i];}

}return max_so_far;

}

Vector Processing Examples – 2 (vectorproc.cpp – not in book)

Write a function that takes a tvector of integers as parameter and returns true if the vector is sorted in ascending manner, false otherwise may not process all vector elements

In this type of rule-checking applications, a possible method is to assume that the rule is satisfied before the loop and find a counterexample in the loop

bool issorted (const tvector<int> & v)//post: returns true if the array is acsending sorted {

bool s = true; // initially assume that array is sorted //in the function try to break this assumptionint i =1;

while (i < v.size() && s == true) { //check until the end of array or until a counterexample is found

if (v[i-1] > v[i]) // if not sorted s = false; // counterexample is foundi++;

}return s;

}

Searching a vector We can search for one occurrence, return true/false or the index

of occurrence Search the vector starting from the beginning Stop searching when match is found

We can search and count the number of occurrences and return count Search entire vector Similar to one occurrence search, but do not stop after first

occurrence

We can search for many occurrences, but return occurrences in another vector rather than count

In all these cases, we search the vector sequentially starting from the beginning This type of search is called “sequential search”

Counting searchint countmatches(const tvector<string> & a, const string& s)// post: returns # occurrences of s in a{ int count = 0; int k; for(k=0; k < a.size(); k++) { if (a[k] == s) { count++; } } return count;}

How can we change this code to return the index of the first occurrence? see next slide

One occurrence searchint firstmatch(const tvector<string> & a, const string& s)// post: returns the index of occurrence of s in a, -1 // otherwise{ int k; for(k=0; k < a.size(); k++) { if (a[k] == s) { return k; } } return -1;}

Does not search the entire array if one match is found good for efficiency purposes

How could you modify this to return true/false?

Collecting searchCollect the occurrences in another vector

void collect(const tvector<string> & a, tvector<string> & matches)// pre: matches is empty// post: matches contains all elements of a with// first letter 'A'{ int k; for(k=0; k < a.size(); k++) {

if (a[k].substr(0,1) == "A") {

matches.push_back(a[k]); } }}

Binary searchAlternative to sequential search for sorted vectorsIf a vector is sorted we can use the sorted property to

eliminate half of the vector elements with one comparisonWhat number (between 1 and 100) do we guess first in

number guessing game?

Idea of creating program to do binary searchCheck the middle element

If it has the searched value, then you’re done! If not, eliminate half of the elements of the vector

search the rest using the same ideacontinue until match is found or there is no match

how could you understand that there is no match?let’s develop the algorithm on an example

we need two index values, low and high, for the search space

Binary Search (search for 62)

10 24 34 52 55 62 67 75 80 81 90 92 100 101 111

low=0 mid=7 high=14

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

low = 0 mid=3 high=6

low=4 high=6

mid=5 => FOUND

Binary Search (search for 60)

10 24 34 52 55 62 67 75 80 81 90 92 100 101 111

low = 0 mid=7 high =14

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14

low=0 mid=3 high=6

low=4 high=6mid=5

low=4 high=4mid=4

low=5 high=4 => NO MATCH FOUND – STOP

Binary search codeint bsearch(const tvector<string>& list, const string& key)// pre: list.size() == # elements in list// post: returns index of key in list, -1 if key not found{ int low = 0; // leftmost possible entry int high = list.size()-1; // rightmost possible entry int mid; // middle of current range

while (low <= high) { mid = (low + high)/2; if (list[mid] == key) // found key, exit search { return mid; } else if (list[mid] < key) // key in upper half { low = mid + 1; } else // key in lower half { high = mid - 1; } } return -1; // not in list}

Comparing Sequential and Binary Search

• Given a list of N elements:• Binary search makes on the order of log N operation

O(log N)• Linear (sequential) search takes on the order of N operations

O(N)