Add inner_product to Table 1

Fixes n3554/n3554#61

Author: jaredhoberock

algorithms.html

@@ -162,119 +162,118 @@ <h1><code>ExecutionPolicy</code> algorithm overloads</h1>
         is <code>true</code>.
       </p>
 
-      <p>The algorithms listed in table <cxx-ref to="tab.parallel.algorithms"></cxx-ref> shall have <code>ExecutionPolicy</code> overloads.</p>
+      <p>The algorithms listed in <cxx-ref to="tab.parallel.algorithms"></cxx-ref> shall have <code>ExecutionPolicy</code> overloads.</p>
 
       <table is="cxx-table" id="tab.parallel.algorithms" class="list">
         <caption>Table of parallel algorithms</caption>
         <tr>
           <td><code>adjacent_difference</code></td>
           <td><code>for_each</code></td>
-          <td><code>none_of</code></td>
-          <td><code>search</code></td>
+          <td><code>move</code></td>
+          <td><code>rotate_copy</code></td>
         </tr>
         <tr>
           <td><code>adjacent_find</code></td>
           <td><code>for_each_n</code></td>
-          <td><code>nth_element</code></td>
-          <td><code>search_n</code></td>
+          <td><code>none_of</code></td>
+          <td><code>search</code></td>
         </tr>
         <tr>
           <td><code>all_of</code></td>
           <td><code>generate</code></td>
-          <td><code>partial_sort</code></td>
-          <td><code>set_difference</code></td>
+          <td><code>nth_element</code></td>
+          <td><code>search_n</code></td>
         </tr>
         <tr>
           <td><code>any_of</code></td>
           <td><code>generate_n</code></td>
-          <td><code>partial_sort_copy</code></td>
-          <td><code>set_intersection</code></td>
+          <td><code>partial_sort</code></td>
+          <td><code>set_difference</code></td>
         </tr>
         <tr>
           <td><code>copy</code></td>
           <td><code>includes</code></td>
-          <td><code>partition</code></td>
-          <td><code>set_symmetric_difference</code></td>
+          <td><code>partial_sort_copy</code></td>
+          <td><code>set_intersection</code></td>
         </tr>
         <tr>
           <td><code>copy_if</code></td>
           <td><code>inclusive_scan</code></td>
+          <td><code>partition</code></td>
+          <td><code>set_symmetric_difference</code></td>
+        </tr>
+        <tr>
+          <td><code>copy_n</code></td>
+          <td><code>inner_product</code></td>
           <td><code>partition_copy</code></td>
           <td><code>set_union</code></td>
         </tr>
         <tr>
-          <td><code>copy_n</code></td>
+          <td><code>count</code></td>
           <td><code>inplace_merge</code></td>
           <td><code>reduce</code></td>
           <td><code>sort</code></td>
         </tr>
         <tr>
-          <td><code>count</code></td>
+          <td><code>count_if</code></td>
           <td><code>is_heap</code></td>
           <td><code>remove</code></td>
           <td><code>stable_partition</code></td>
         </tr>
         <tr>
-          <td><code>count_if</code></td>
+          <td><code>equal</code></td>
           <td><code>is_partitioned</code></td>
           <td><code>remove_copy</code></td>
           <td><code>stable_sort</code></td>
         </tr>
         <tr>
-          <td><code>equal</code></td>
+          <td><code>exclusive_scan</code></td>
           <td><code>is_sorted</code></td>
           <td><code>remove_copy_if</code></td>
           <td><code>swap_ranges</code></td>
         </tr>
         <tr>
-          <td><code>exclusive_scan</code></td>
+          <td><code>fill</code></td>
           <td><code>is_sorted_until</code></td>
           <td><code>remove_if</code></td>
           <td><code>transform</code></td>
         </tr>
         <tr>
-          <td><code>fill</code></td>
+          <td><code>fill_n</code></td>
           <td><code>lexicographical_compare</code></td>
           <td><code>replace</code></td>
           <td><code>uninitialized_copy</code></td>
         </tr>
         <tr>
-          <td><code>fill_n</code></td>
+          <td><code>find</code></td>
           <td><code>max_element</code></td>
           <td><code>replace_copy</code></td>
           <td><code>uninitialized_copy_n</code></td>
         </tr>
         <tr>
-          <td><code>find</code></td>
+          <td><code>find_end</code></td>
           <td><code>merge</code></td>
           <td><code>replace_copy_if</code></td>
           <td><code>uninitialized_fill</code></td>
         </tr>
         <tr>
-          <td><code>find_end</code></td>
+          <td><code>find_first_of</code></td>
           <td><code>min_element</code></td>
           <td><code>reverse</code></td>
           <td><code>uninitialized_fill_n</code></td>
         </tr>
         <tr>
-          <td><code>find_first_of</code></td>
+          <td><code>find_if</code></td>
           <td><code>minmax_element</code></td>
           <td><code>reverse_copy</code></td>
           <td><code>unique</code></td>
         </tr>
         <tr>
-          <td><code>find_if</code></td>
+          <td><code>find_if_not</code></td>
           <td><code>mismatch</code></td>
           <td><code>rotate</code></td>
           <td><code>unique_copy</code></td>
         </tr>
-        <tr>
-          <td><code>find_if_not</code></td>
-          <td><code>move</code></td>
-          <td><code>rotate_copy</code></td>
-          <td></td>
-          <td></td>
-        </tr>
       </table>
     </cxx-section>
   </cxx-section>