:orphan:

|rss_image|  **processor - 1/1** :ref:`Blog <ap-main-0>` :ref:`C++ (3) <ap-cat-C++-0>`

.. |rss_image| image:: feed-icon-16x16.png
    :target: ../_downloads/rss.xml
    :alt: RSS

----


.. index:: processor


.. _ap-cat-processor-0:

processor - 1/1
+++++++++++++++

.. blogpostagg::
    :title: Branching
    :date: 2019-02-04
    :keywords: branching,optimization
    :categories: processor
    :rawfile: 2019/2019-02-04_benchmark.rst

    I wanted to test some facts described in the following blog post:
    `Why is it faster to process a sorted array than an unsorted array?
    <https://stackoverflow.com/questions/11227809/why-is-it-faster-to-process-a-sorted-array-than-an-unsorted-array>`_.
    I ended it writing this notebook :ref:`cbenchmarkbranchingrst`
    which compares a couple of implementations of the same computation,
    a dot product.





----

|rss_image|  **processor - 1/1** :ref:`2018-08 (2) <ap-month-2018-08-0>` :ref:`2019-02 (1) <ap-month-2019-02-0>` :ref:`2019-03 (1) <ap-month-2019-03-0>` :ref:`2019-09 (1) <ap-month-2019-09-0>` :ref:`2021-01 (1) <ap-month-2021-01-0>`