Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Program to calculate Bitonicity of an Array
The bitonicity of an array is defined using the following syntax −
To find 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
The code for finding the bitonicity of an array we have used a variable called bitonicity, that changes its based on the comparison of the current and previous elements of the array. The above logic updates the bitonicity of the array and 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
Bitonicity = 1
Updated on: 01-Jul-2020
55 Views
Advertisements