Program to calculate the bivalence of an array

The bitonicity of an array is defined using the following syntax-

Finding the bitonicity of an array based on its elements is-

Bitonicity　=　0　,　initially　arr[0]
i　from　0　to　n
Bitonicity　=　Bitonicity+1　;　if　arr[i]　>　arr[i-1]
Bitonicity　=　Bitonicity-1　;　if　arr[i]　<　arr[i-1]
Bitonicity　=　Bitonicity　;　if　arr[i]　=　arr[i-1]

Example

In the code for finding the bitonicity of an array, we use a variable called bitonicity, which changes its value based on the comparison of the current element and the previous element of the array. The above logic updates the bitonicity of the array, and the final bitonicity can be found at the end of the array.

#include　<iostream>
using　namespace　std;
int　main()　{
　　　int　arr[]　=　{　1,　2,　4,　5,　4,　3　};
　　　int　n　=　sizeof(arr)　/　sizeof(arr[0]);　int　Bitonicity　=　0;
　　　for　(int　i　=　1;　i　<　n;　i++)　{
　　　　　　if　(arr[i]　>　arr[i　-　1])
　　　　　　　　　Bitonicity++;
　　　　　　else　if　(arr[i]　<　arr[i　-　1])　Bitonicity--;
　　　}
　　　cout　<<　"Bitonicity　=　"　<<　Bitonicity;
　　　return　0;
}

Output Result

Bitonicity　=　1