Why processing a sorted array is faster than an unsorted one

Hello everyone! I'm a beginner C++ developer and I've encountered a very strange problem while optimizing code. I have a simple loop that sums array elements, but only those that are greater than a certain threshold. I noticed that if the array is sorted, the code runs several times faster than if it is unsorted. Here's an example code:\n\n```cpp\n#include \n#include \n#include \n#include \n\nint main() {\n const int SIZE = 100000;\n std::vector data(SIZE);\n \n // Fill the array with random numbers\n for (int i = 0; i < SIZE; ++i) {\n data[i] = rand() % 256;\n }\n \n // Sort the array for the first test\n std::vector sorted_data = data;\n std::sort(sorted_data.begin(), sorted_data.end());\n \n