Skip to main content

Add Java Code for Swapping Alternate Elements in an Array

 Question: 

You have been given an array/list(ARR) of size N. You need to swap every pair of alternate elements in the array/list.

You don't need to print or return anything, just change in the input array itself.


Ans: 

package learningJava;

import java.util.*;

public class swapAlternate {

public static int [] swapAlternate(int arr[], int size, int temp) {


for(int i = 0 ; i < size-1; i = i+2) {

temp = arr[i];

arr[i] = arr[i+1];

arr[i+1] = temp;

}

return arr;

}

//main function start from here

public static void main(String[] args) {

Scanner scan = new Scanner(System.in);

System.out.print("Enter Size of Array:");

int size = scan.nextInt();

int temp = 0;

System.out.println("Enter Array Element:");

int arr [] = new int[size];

for(int i = 0 ; i < size; i++) {

arr[i] = scan.nextInt();

}

/// Call to function

swapAlternate(arr,size,temp);

for(int i = 0 ; i < size; i++) {

System.out.print(arr[i] + " ");


}

}

}


Question: What is Swap Alternate in Java ?
Ans: 

"Swap alternate" ka matlab hota hai ki aap ek array ke alternate elements ko yaani ki har doosre element ko aapas mein swap kar dete hain. Java mein, aap ise do tareeko se kar sakte hain:

Temporary Variable Ka Istemal: Aap ek temporary variable ka istemal karke do elements ko swap kar sakte hain. Yeh tareeka kaafi straightforward hai. Aap ek element ko temporary variable mein store karke dusre element ko us jagah par rakh sakte hain aur phir temporary variable mein stored element ko dusre jagah par rakh sakte hain.

Example:

java

int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
Bitwise XOR Ka Istemal: Aap bitwise XOR operator (^) ka istemal karke bhi elements ko swap kar sakte hain, lekin yeh approach advanced users ke liye hota hai. Ismein bina temporary variable ke elements ko swap kiya jata hai.

Example:

java

arr[i] = arr[i] ^ arr[i + 1];
arr[i + 1] = arr[i] ^ arr[i + 1];
arr[i] = arr[i] ^ arr[i + 1];
Yeh tareekon se aap Java mein "swap alternate" operation kar sakte hain, jisse aap ek array ke elements ko aapas mein swap kar sakte hain.

Comments

Popular posts from this blog

Excel For Data Analysis

 sum = Add numbers, it is basically sumission  =SUM(number1, [number2], ...) Example: =SUM(A1:A7)  ⚡ Tips: You can use AutoSum for quick addition: Select a cell → click Home → AutoSum (Σ) → press Enter . Shortcut key: Alt + = (automatically inserts =SUM() ). Min = TO FIND MINIMUM VALUE  =MIN(A1:A12)  max = TO FIND MAXIMUM VALUE =MAX(A1:A13)  Right  ExamPle: =RIGHT(E2,10)  basically mere pas number hai 91 country code ke sath, main chahta hu 91 code ke bad right se 10 numbers mujhe nikal ke aa jaye yaha E2 mera column number hai and 10 jo mujhe chahiye right se Cases: किसी product code ke last digits निकालने के लिए  किसी date ya year ke last 2 digits निकालने के लिए किसी naam ke last letters निकालने के लिए Note: if I want to paste horizontally number then will use 'paste ke option me transpose left  == left se digits extract krne ke liye will use this  =LEFT(E2,2)   E2 IS CELL AND 2 IS DIG...

Statistics Data Science

  Types of Data: - Majorly deal with 2 types of data : 1) Numberical Data[continuos data] ex: age, salary, height                                                             Objective: Quantative Study                                                              2) Categorical Data[Dispreet Data]: ex: Gender, City etc                                                ...

Queues Data Strucuture in Java

 Queues is based on FIFO model means first in first out. Jis tarh ham stacks me data add krne ke liye push use krte the usi tarh QUEUES me data add krne ke enqueue likhte hai and if u want to remove element from queues we will use dequeue Queues me sare insertion rear end me hota hai. In Java, a queue is a data structure that follows the First-In-First-Out (FIFO) principle, meaning that the element added first will be removed first. Java provides several implementations of queues through the Queue interface, which is a part of the Java Collections Framework. The Queue interface extends the Collection interface and adds specific methods relevant to queues. Problem statement Send feedback A queue is a ? Ans: FIFO (First in First out)