Find element in a vector using a linear search : vector indexer « vector « C++ Tutorial

Home
C++ Tutorial
1.Language Basics
2.Data Types
3.Operators statements
4.Array
5.Development
6.Exceptions
7.Function
8.Structure
9.Class
10.Operator Overloading
11.Pointer
12.File Stream
13.template
14.STL Introduction
15.string
16.vector
17.list
18.bitset
19.set multiset
20.valarray
21.queue stack
22.deque
23.map multimap
24.STL Algorithms Modifying sequence operations
25.STL Algorithms Non modifying sequence operations
26.STL Algorithms Binary search
27.STL Algorithms Sorting
28.STL Algorithms Merge
29.STL Algorithms Min Max
30.STL Algorithms Iterator
31.STL Algorithms Heap
32.STL Algorithms Helper
C / ANSI-C
C Tutorial
C++
Visual C++ .NET
C++ Tutorial » vector » vector indexer 
16.17.4.Find element in a vector using a linear search
#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>

using namespace std;

int linear_search(vector<int> v, int a){  
   for (int i = 0; i < v.size(); i++){  
      if (v[i== a)
         return i;
   }
   return -1;
}

void print(vector<int> a){  
   for (int i = 0; i < a.size(); i++)
      cout << a[i<< " ";
   cout << "\n";
}

void rand_seed(){  
   int seed = static_cast<int>(time(0));
   srand(seed);
}

int rand_int(int a, int b){  
   return a + rand() (b - a + 1);
}

int main()
{  
   rand_seed();
   vector<int> v(20);
   for (int i = 0; i < v.size(); i++)
      v[i= rand_int(1100);
   print(v);
   cout << "Enter number to search for: ";
   int n;
   cin >> n;
   int j = linear_search(v, n);
   cout << "Found in position " << j << "\n";
   return 0;
}
16.17.vector indexer
16.17.1.Use indexer to update element in the vector
16.17.2.Use toupper function to convert all elements in a char vector to upper case
16.17.3.Returns all values within a range
16.17.4.Find element in a vector using a linear search
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.