Arrays 如何输出两个类(OddArrSe3和BubbleSort4)的答案
请帮忙。我正在尝试组合两个类(bubblesort4和OddArrSe3),以从bubblesort4获得答案,并显示在OddArrSe3上,例如System.out.println(“气泡排序:”)Arrays 如何输出两个类(OddArrSe3和BubbleSort4)的答案,arrays,class,output,Arrays,Class,Output,请帮忙。我正在尝试组合两个类(bubblesort4和OddArrSe3),以从bubblesort4获得答案,并显示在OddArrSe3上,例如System.out.println(“气泡排序:”) 我想做的是得到以下编码的答案: System.out.println(“气泡排序前的数组”); for(int i=0;i
我想做的是得到以下编码的答案:
System.out.println(“气泡排序前的数组”);
for(int i=0;i
=================================================================================
出现在:
System.out.println(“气泡排序:+bubbleSort.sortbuble(intArray))
任何帮助都将不胜感激。提前谢谢。
下面是完整的编码
import java.util.ArrayList;
import java.util.List;
import java.util.*;
public class OddArrSe3
{
public static void main(final String[] args)
{
int[] array_sort = {10,41,21,24,34,15,40,12,32,23,13,25,30,31,22,33,14,35,20,11};
ArrayList<Integer> OddArr = new ArrayList<Integer>();
ArrayList<Integer> EvenArr = new ArrayList<Integer>();
for (int i : array_sort)
{
if ((i & 1) == 1)
{
OddArr.add(i);
}
else
{
EvenArr.add(i);
}
}
Collections.sort(OddArr);
Collections.sort(EvenArr);
System.out.println("Odd:" + OddArr);
System.out.println("Even:" + EvenArr);
int OddArr2[] = {11, 13, 15, 21, 23, 25, 31, 33, 35, 41};
int toSearch = 31;
int EvenArr2[] = {10, 12, 14, 20, 22, 24, 30, 32, 34, 40};
int toSearch2 = 32;
LinearSearch4 linearSearch = new LinearSearch4();
BinarySearch4 binarySearch = new BinarySearch4();
Bubblesort4 bubblesSort = new BubbleSort4();
System.out.println("Linear Search Index : "
+ linearSearch.searchLinear(OddArr2, toSearch));
System.out.println("Binary Search Index : "
+ binarySearch.searchBinary(EvenArr2, toSearch2));
System.out.println ("Bubble Sort : " + bubbleSort.sortBubble(intArray));
}
}
import java.util.ArrayList;
导入java.util.List;
导入java.util.*;
公共类OddArrSe3
{
公共静态void main(最终字符串[]args)
{
int[]数组_sort={10,41,21,24,34,15,40,12,32,23,13,25,30,31,22,33,14,35,20,11};
ArrayList OddArr=新的ArrayList();
ArrayList EvenArr=新的ArrayList();
for(int i:array\u sort)
{
如果((i&1)==1)
{
OddArr.添加(i);
}
其他的
{
添加(i)项;
}
}
Collections.sort(OddArr);
集合。排序(EvenArr);
System.out.println(“奇数:+OddArr”);
System.out.println(“偶数:+EvenArr”);
int OddArr2[]={11,13,15,21,23,25,31,33,35,41};
int-toSearch=31;
int EvenArr2[]={10,12,14,20,22,24,30,32,34,40};
int-toSearch2=32;
LinearSearch4 linearSearch=新的LinearSearch4();
BinarySearch4 binarySearch=新的BinarySearch4();
Bubblesort4 BubbleSort=新的Bubblesort4();
System.out.println(“线性搜索索引:”
+线性搜索线性搜索(OddArr2,toSearch));
System.out.println(“二进制搜索索引:”
+searchBinary(EvenArr2,toSearch2));
System.out.println(“气泡排序:+bubbleSort.sortbuble(intArray));
}
}
气泡港4
public class BubbleSort4
{
public static void main(String[] args) {
int intArray[] = new int[]{5,90,35,45,150,3};
System.out.println("Array Before Bubble Sort");
for(int i=0; i < intArray.length; i++)
{
System.out.print(intArray[i] + " ");
}
bubbleSort(intArray);
System.out.println("");
System.out.println("Array After Bubble Sort");
for(int i=0; i < intArray.length; i++)
{
System.out.print(intArray[i] + " ");
}
}
private static void bubbleSort(int[] intArray)
{
int n = intArray.length;
int temp = 0;
for(int i=0; i < n; i++)
{
for(int j=1; j < (n-i); j++)
{
if(intArray[j-1] > intArray[j])
{
temp = intArray[j-1];
intArray[j-1] = intArray[j];
intArray[j] = temp;
}
}
}
}
公共类BubbleSort4
{
公共静态void main(字符串[]args){
int intArray[]=新int[]{5,90,35,45150,3};
System.out.println(“气泡排序前的数组”);
for(int i=0;iintArray[j])
{
温度=内阵列[j-1];
intArray[j-1]=intArray[j];
intArray[j]=温度;
}
}
}
}
}为什么有两种主要方法?我正试图将它们组合在一起
public class BubbleSort4
{
public static void main(String[] args) {
int intArray[] = new int[]{5,90,35,45,150,3};
System.out.println("Array Before Bubble Sort");
for(int i=0; i < intArray.length; i++)
{
System.out.print(intArray[i] + " ");
}
bubbleSort(intArray);
System.out.println("");
System.out.println("Array After Bubble Sort");
for(int i=0; i < intArray.length; i++)
{
System.out.print(intArray[i] + " ");
}
}
private static void bubbleSort(int[] intArray)
{
int n = intArray.length;
int temp = 0;
for(int i=0; i < n; i++)
{
for(int j=1; j < (n-i); j++)
{
if(intArray[j-1] > intArray[j])
{
temp = intArray[j-1];
intArray[j-1] = intArray[j];
intArray[j] = temp;
}
}
}
}