Demonstrate inner_product() in vector : Vector « Data Structure « C++






Demonstrate inner_product() in vector

Demonstrate inner_product() in vector


#include <iostream>
#include <vector>
#include <numeric>
using namespace std;

int main()
{
  vector<int> vectorObject1(5), vectorObject2(5);
  int i, total;

  for(i = 0; i < 5; i++) 
     vectorObject1[ i ] = i;
  for(i = 0; i < 5; i++) 
     vectorObject2[ i ] = i+2;

  total = inner_product(vectorObject1.begin(), vectorObject1.end(), vectorObject2.begin(), 0);

  cout << "Inner product is: " << total;

  return 0;
}


           
       








Related examples in the same category

1.Perform an in-place merge for two vectorsPerform an in-place merge for two vectors
2.Using Other Search functionsUsing Other Search functions
3.Matching Elements Using the equals and mismatch OperationsMatching Elements Using the equals and mismatch Operations
4.Creating and Resizing VectorsCreating and Resizing Vectors
5.Demonstrate count and count_if.Demonstrate count and count_if.
6.Demonstrate remove_copy in VectorDemonstrate remove_copy in Vector
7.Access a vector using an iterator.Access a vector using an iterator.
8.Demonstrate insert and erase.Demonstrate insert and erase.
9.Store a class object in a vector. Store a class object in a vector.
10.Demonstrate allocator's max_size() fucntion in vectorDemonstrate allocator's max_size() fucntion in vector
11.Demonstrate count() in vectorDemonstrate count() in vector
12.Demonstrate count_if().Demonstrate count_if().
13.Demonstrate reverse in vectorDemonstrate reverse in vector
14.Demonstrate insert_iterator in vectorDemonstrate insert_iterator in vector
15.Demonstrate adjacent_difference() in vectorDemonstrate adjacent_difference() in vector
16.Demonstrate partial_sum() in VectorDemonstrate partial_sum() in Vector
17.Storing Class Objects with overloaded operators in a Vector
18.Vector Init Array
19.Use istream_iterator with the copy algorithm
20.Demonstrate remove_copy and replace_copy.
21.Vector: Insert Erase Sort
22.Demonstrate accumulate() in vector
23.end() in vector
24.Use pop_back() and empty().
25.Access the elements of a vector through an iterator.
26.The basic operation of a vector: size, push_back,
27.Accessing a Vector Through an Iterator
28.Use istream_iterator to read various data types
29.Create permutations based on vector
30.Work with heaps: make_heap from vector
31.Demonstrating the four ways that vectors can be created.
32.Vector Capacity vs size
33. Using clear()