SDE - Intern

You are given an array ‘ARR’ of size ‘N’. The array contains ‘N’ positive integers.

You want to sort the array in ascending order by doing some operations.

In one operation, you can select two adjacent indexes and swap them if the parity of both values is not the same. In other words, you can only swap two elements if they are adjacent and one is odd, and the other is even.

Can you tell if you can sort the array?

Example :

N = 4
ARR =[ 1, 0, 3, 2 ]
If we swap ‘1’ and ‘0’ and ‘3’ and ‘2’, after applying these operations, our array becomes sorted. So ‘ANS’ is ‘1’.

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

You are given an unsorted array consisting of N non-negative integers. Your task is to sort the array in non-decreasing order using the Bubble Sort algorithm.

For Example:

Bubble Sort implementation for the given array:  {6,2,8,4,10} is shown below :-

Why do you want to join cisco? 

Why we should hire u? 

What do u know about cisco and cisco's competitors