Scribd
Upload
11 views12 pages

1-D Array Part 2

The document contains multiple Java programs that demonstrate various operations on 1-D arrays, including generating Fibonacci numbers, modifying strings, searching for a target number, reversing arrays, sorting, checking if an array is increasing, finding the median and mode, identifying the longest run of identical elements, shuffling an array, and merging two string arrays. Each program includes a main method that prompts the user for input and displays the results. The code snippets illustrate fundamental programming concepts such as loops, conditionals, and array manipulation.

Uploaded by

kate.koontz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views12 pages

1-D Array Part 2

The document contains multiple Java programs that demonstrate various operations on 1-D arrays, including generating Fibonacci numbers, modifying strings, searching for a target number, reversing arrays, sorting, checking if an array is increasing, finding the median and mode, identifying the longest run of identical elements, shuffling an array, and merging two string arrays. Each program includes a main method that prompts the user for input and displays the results. The code snippets illustrate fundamental programming concepts such as loops, conditionals, and array manipulation.

Uploaded by

kate.koontz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

1-D Arrays Part 2 Homework

Question 1:
/**
*
*
*/
public class D1Array_Fibonnaci {
public static int Fibonaci(int n) {
if (n==1||n==2)
return 1;
else return Fibonaci(n-1)+Fibonaci(n-2);
}

public static void main(String[] args) {


int[] array=new int[20];
for (int i=0;i<20;i++) {
array[i]=Fibonaci(i+1);
}
for (int j=0;j<array.length;j++) {
System.out.println(array[j]+" ");
}
}
}

Question 2:
import java.util.Scanner;

/**
*
*
*/
public class D1Array_Izzle {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
String sentence;
System.out.println("what is the sentence?");
sentence=in.nextLine();
String[] word=sentence.split(" ");
for (int i=0;i<word.length;i++) {
word[i]+="izzle";
word[i]=word[i].toUpperCase();
System.out.print(word[i]+" ");
}
}
}

Question 3:
import java.util.Scanner;

/**
*
*
*/
public class D1Array_Target {
public static boolean search(int[] array, int target) {
for (int i=0;i<array.length;i++) {
if (array[i]==target) {
return true;
}
}
return false;
}

public static void main(String[] args) {


Scanner in=new Scanner(System.in);
int[] array;
System.out.println("How many numbers do you want to enter");
int n=in.nextInt();
array=new int[n];
for (int i=0;i<array.length;i++) {
System.out.println("Type a price.");
array[i]=in.nextInt();
}
System.out.println("Type a target number");
int target=in.nextInt();
System.out.println("Target number: "+target);
System.out.println(search(array, target));
}
}

Question 4:
import java.util.Scanner;

/**
*
*
*/
public class D1Array_ReverseMethod {
public static void reverse(int[] arr) {
int temp;
for (int i=0;i<arr.length/2;i++) {
temp=arr[i];
arr[i]=arr[arr.length-1-i];
arr[arr.length-1-i]=temp;
}
for (int i=0;i<arr.length;i++) {
System.out.print(arr[i]+" ");
}
}

public static void main(String[] args) {


Scanner in=new Scanner(System.in);
int[] arr;
System.out.println("How many numbers do you want in the array?");
int n=in.nextInt();
arr=new int[n];
for (int i=0;i<arr.length;i++) {
System.out.println("Type an integer");
arr[i]=in.nextInt();
}
for (int i=0;i<arr.length;i++) {
System.out.print(arr[i]+" ");
}
System.out.println();
reverse(arr);
}
}

Question 5:
import java.util.Scanner;

/**
*
*
*/
public class D1Array_IncreasingOrder {
public static void sort(int[] arr) {
int temp=0;
for (int i=0;i<arr.length-1;i++) {
for (int j=i+1;j<arr.length;j++)
if(arr[j]<arr[i]) {
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
for (int i=0;i<arr.length;i++)
System.out.print(arr[i]+" ");
}

public static void main(String[] args) {


Scanner in=new Scanner(System.in);
int[] arr;
System.out.println("How many integers do you want in the array");
int n=in.nextInt();
arr=new int[n];
for (int i=0;i<arr.length;i++) {
System.out.println("Type an integer");
arr[i]=in.nextInt();
}
System.out.println();
sort(arr);
}
}

Question 6:
import java.util.Scanner;

/**
*
*
*/
public class D1Array_isIncreasing {
public static boolean isIncreasing(int[] arr) {
for (int i=1;i<arr.length;i++) {
if (arr[i]<=arr[i-1]) {
return false;
}
}
return true;
}

public static void main(String[] args) {


Scanner in=new Scanner(System.in);
int[] arr;
System.out.println("How many integers do you want in the array");
int n=in.nextInt();
arr=new int[n];
for (int i=0;i<arr.length;i++) {
System.out.println("Type an integer");
arr[i]=in.nextInt();
}
System.out.println("The system is in increasing order: "+isIncreasing(arr));
}
}

Question 7:
import java.util.Scanner;
/**
*
*
*/
public class D1Array_Median {
public static void sort(int[] arr) {
int temp;
for (int i=0;i<arr.length-1;i++) {
for (int j=i+1;j<arr.length;j++) {
if (arr[j]<arr[i]) {
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}
}
public static void findMedian(int[] arr) {
sort(arr);
int n=arr.length;
double median;
if (n%2==0) {
median=(arr[n/2-1]+arr[n/2])/2.0;
}
else {
median=arr[n/2];
}
System.out.println("The median is: "+median);
}
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int[] arr;
System.out.println("How many integers do you want to enter?");
int n=in.nextInt();
arr=new int[n];
for (int i=0;i<arr.length;i++) {
System.out.println("Type an integer");
arr[i]=in.nextInt();
}
findMedian(arr);
}
}

Question 8:
import java.util.Scanner;
/**
*
*
*/
public class D1Array_findMode {
public static void findMode(int[] arr) {
int count=0, maxcount=1, x=0;
for (int i=0;i<arr.length;i++) {
count=0;
for (int j=0;j<arr.length;j++) {
if (arr[j]==arr[i]) {
count++;
}

if(maxcount>count) {
maxcount=count;
x=arr[i];
}
}
}
if (maxcount==1)
System.out.println("There is no mode");
else
System.out.println("Mode: "+x);
}
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int[] arr;
System.out.println("How many integers do you want to enter?");
int n=in.nextInt();
arr=new int[n];
for (int i=0;i<arr.length;i++) {
System.out.println("Type an integer.");
arr[i]=in.nextInt();
}
findMode(arr);
}
}

Question 9:
import java.util.Scanner;

/**
*
*
*/
public class D1Array_LongestRun {
public static int longestRun(int[] arr) {
if (arr.length==0) {
return 0;
}
int count=1, maxcount=0;
for (int i=1;i<arr.length;i++) {
if (arr[i]==arr[i-1]) {
count++;
}
else {
if (count>maxcount) {
maxcount=count;
}
count=1;
}
}
if (count>maxcount) {
maxcount=count;
}
return maxcount;
}
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int[] arr;
System.out.println("How many integers do you want to enter?");
int n=in.nextInt();
arr=new int[n];
for (int i=0;i<arr.length;i++) {
System.out.println("Type an integer");
arr[i]=in.nextInt();
}
System.out.println("Longest run: "+longestRun(arr));
}
}

Question 11:
import java.util.Scanner;

/**
*
*
*/
public class ShuffleArray {
public static void shuffle(int[] arr) {
int middle=arr.length/2;
int k=0;
int[] shuffled=new int[arr.length];
for (int i=0;i<middle;i++) {
shuffled[k++]=arr[i];
shuffled[k++]=arr[middle+i];
}
for (int i=0;i<arr.length;i++) {
arr[i]=shuffled[i];
}
for (int i=0;i<arr.length;i++) {
System.out.print(arr[i]+" ");
}
}

public static void main(String[] args) {


Scanner in=new Scanner(System.in);
int[] arr=new int[10];
for (int i=0;i<arr.length;i++) {
System.out.println("Type an integer");
arr[i]=in.nextInt();
}
System.out.println("Oringial array: ");
for (int i=0;i<arr.length;i++) {
System.out.print(arr[i]+" ");
}
System.out.println();
System.out.println("Shuffled array: ");
shuffle(arr);
}
}

Question 10:
import java.util.Scanner;

/**
*
*
*/
public class D1Array_Merge {
public static String[] merge(String[] arr1, String[] arr2) {
String[] arr3=new String[arr1.length+arr2.length];
int i=0, j=0, k=0;
while (i<arr1.length||j<arr2.length) {
if (i<arr1.length && (j>=arr2.length||arr1[i].compareTo(arr2[j])<0)) {
if (k==0||!arr3[k-1].equals(arr1[i])) {
arr3[k++]=arr1[i];
}
i++;
}
else if(j<arr2.length) {
if (k==0||!arr3[k-1].equals(arr2[j])) {
arr3[k++]=arr2[j];
}
j++;
}
}
String[] array3 = new String[k];
for (int m=0;m<k; m++) {
array3[m] = arr3[m];
}
return array3;
}

public static void main(String[] args) {


Scanner in=new Scanner(System.in);
String[] arr1;
String[] arr2;
System.out.println("How many words do you want in string one?");
int n1=in.nextInt();
in.nextLine();
arr1=new String[n1];
for (int i=0;i<arr1.length;i++) {
System.out.println("Type a word.");
arr1[i]=in.nextLine();
}
System.out.println("How many words do you want in string two?");
int n2=in.nextInt();
in.nextLine();
arr2=new String[n2];
for (int i=0;i<arr2.length;i++) {
System.out.println("Type a word.");
arr2[i]=in.nextLine();
}
String[] mergedarr=merge(arr1, arr2);
System.out.println("Merged array:");
for (String word:mergedarr) {
System.out.println(word);
}
}
}

If (n==1||n==2) {
Return 1;
Else return Fibonaci(n-1)+Fibonaci(n-2);

Find Maximum:
Public static void main(String[] args) {
Int[] arr;
Int count=0, j=0;
System.out.println(“How many numbers do you want”);
Int n=in.nextInt();
arr=new int[n];
For (int i=0;i<arr.length;i++){
System.out.println(“Type a number”);
arr[i]=in.nextInt();}
Int min=arr[0];
For (int i=0;i<arr.length;i++) {
If (arr[i]<min) {
j=count;
min=arr[i]; }
count++;
Minimum index: j

Increasing Order:
Public static boolean increasing(int[] arr) {
Int temp=0;
for(int i=0;i<arr.length-1;i++){
for(j=i+1;j<arr.lenght;j++){
If (arr[j]<arr[i]) {
IZZLE:
Public static void main(String[] args) {
System.out.println(“Type a sentence.”);
String sentence=in.nextLine();
String[] word=sentence.split(“ “);
for(int i=0;i<word.length;i++)
word{i]+=”izzle”;
word

You might also like