Skip to main content

Array - Java Programming

//Array Is a Basic Data Structure in Computer Programming. Array Have Continues Memory Allocation
in Memory Space. Data Are Stored In Continues memory space . We Access Using the index Of The
Element. Index Start From 0 to n-1

//Basic Operations in Array

/*

  1. traverse
  2. search
  3. find
  4. insert
  5. Remove


*/


class array{

//Traverse A Array
public static void traverse(int[] arr){
int n=arr.length;
for(int i=0;i<n;i++){
System.out.println(arr[i]);
}
}


//Find Value By Index
public static void findByIndex(int[] arr,int index){
System.out.println(arr[index]);
}


//Find Index By Value
public static void findIndex(int[] arr,int value){
int n=arr.length;
for(int i=0;i<n;i++){
if(arr[i]==value){
System.out.println(i);
}
}
}

//Insert Function (Array Copy Method)
public static void insert(int[] arr,int index,int value){
int n=arr.length;
int[] brr=new int[n+1];

for(int i=0;i<index;i++){
brr[i]=arr[i];
}
int j=index;
while(j<n){
brr[j+1]=arr[j];
j++;
}
brr[index]=value;
traverse(brr);
}

//Remove Element By Index (Array Copy Method)
public static void removeByIndex(int[] arr,int index){
int n=arr.length;
int[] brr=new int[n-1];

for(int i=0;i<index;i++){
brr[i]=arr[i];
}

for(int i=index;i<n-1;i++){
brr[i]=arr[i+1];
}
traverse(brr);
}

public static void main(String[] args){
int[] arr={2,3,4,5,1};

//treaverse array
//traverse(arr);
//findByIndex(arr,3);
//insert(arr,2,5);
removeByIndex(arr,2);
}
}

Comments

Post a Comment

Popular posts from this blog

LPS(Longest Prefix Which Is Also Suffix) Array Generation Using Java

import java.util.* ; //Longest Prefix Which Is Also Suffix Which Is Used To Found a Pattern Through Avoid Repeated Characters in Given String. We Will Discuss KMP ALGORITHM TO Find A Pattern In Given String Latter. class lbs{ public static void main( String [] args){ Scanner in= new Scanner(System.in); //Get Input From User String s=in.nextLine(); //Convert String Into Char Array char [] ch=s.toCharArray(); int n=s.length(); int [] lbsArr= new int [n]; int j= 0 ,i= 1 ; lbsArr[ 0 ]= 0 ; //LPS ARRAY ALGORITHM /* i=1; j=0; string s="aaab" while i<n if s[i]==s[j]: lpsArr[i]=j; j=j+1 i=i+1 else: if j==0: lbsArr[j]=0 i=i+1 else: ...
1 comment
Read more

Stack is Linear Data Structure- Basic DSA In Java Programming

  /* Stack Is a Linear Data Structure.FIFO(First In First Out) or LIFO(Last In First Out). [ Elements ] [ Elements ] [ Elements ] [ Elements ] */ import java.util.*; class stack{ public static void main( String [] args){ Stack < Integer > s= new Stack < Integer >(); //Push Element To Stack s.push( 10 ); s.push( 5 ); s.push( 2 ); s.push( 1 ); System.out.println(s); /* After Push The Stack Like [ 1 ] <---Push And Pop In Top Of The Statck [ 2 ] [ 5 ] [ 10] */ //Pop Element From Statck s.pop(); System.out.println(s); /* After Pop From Stack [ 1 ]--> Pop From Top Of The Stack [ 5 ] [ 10] */ System.out.println(s.peek()); /* s.peek(); Shows Top Of The Stack */ /* s.empty() returns boolean V...
Post a Comment
Read more

if control statement - Basic Programming Concepts With psudo Code

if( )  is a control statement. it based on some condition. if the condition can true the block of statements can execute other wise skip the statements. syntax if([condition]) { //statement; } example1, #include<stdio.h> #include<conio.h> main() int num=1; { if(num==1) { printf("\n its true"); } } from the above program we can declare the variable named as num and assign the value as 1. then, check the value 1 equal value of num through if statement.the statement can true.so, the block of statements can executed. example2, #include<stdio.h> #include<conio.h> main() int num=5; { if(num==1) { printf("\n its true"); } } suppose the value of num is 5.the block of if statement can skip to execution.
Post a Comment
Read more