java一维数组排序及算法
来源:互联网 发布:淘宝好评返现规则 编辑:程序博客网 时间:2024/06/06 12:38
package com.axesline.sun;
import java.util.Random;
public class getMaxMin_Number {
public static void main(String[] args) {
int[] arry = new int[20];
Random r = new Random();
//给数组 随机赋值
for (int i = 0; i < arry.length; i++) {
arry[i] = r.nextInt(100);
System.out.print(arry[i]+" ");
}
System.out.println();
System.out.println("降序排列的结果: ");
sort(arry);
System.out.println();
System.out.println("冒泡排序的结果: ");
maoPao(arry);
System.out.println();
System.out.println("选择排序的结果: ");
xuanZe(arry);
System.out.println();
System.out.println("插入排序的结果: ");
chaRu(arry);
System.out.println();
System.out.println("希尔排序的结果: ");
xiEr(arry);
System.out.println();
System.out.println("最大值最小值和值: ");
maxMinSum(arry);
}
//降序
private static void sort(int[] arry) {
int t=0;
for(int i=0;i<arry.length-1;i++){
for(int m=i+1;m<arry.length;m++) {
if(arry[i]>arry ){
t=arry[i];
arry[i]=arry ;
arry =t;
}
}
}
for(int i=0;i<arry.length;i++){
System.out.print(arry[arry.length-1-i]+" ");
}
}
//冒泡
public static void maoPao(int[] arry){
int temp =0;
for (int i = 0; i < arry.length-1; i++) {
for (int j = i+1; j < arry.length; j++) {
if(arry[i]>arry[j]){
temp = arry[j];
arry[j] = arry[i];
arry[i] = temp;
}
}
}
for (int i = 0; i < arry.length; i++) {
System.out.print(arry[i]+" ");
}
}
//选择
public static void xuanZe(int[] arry){
for (int i = 0; i < arry.length; i++) {
int lowerindex = i;
for (int j = i+1; j < arry.length; j++) {
if(arry[j]<arry[lowerindex]){
lowerindex = j;
}
}
int temp = arry[i];
arry[i] = arry[lowerindex];
arry[lowerindex] = temp;
}
for (int i = 0; i < arry.length; i++) {
System.out.print(arry[i]+" ");
}
}
//插入
public static void chaRu(int[] arry){
for (int i = 1; i < arry.length; i++) {
for (int j = i; j > 0; j--) {
if(arry[j]<arry[j-1]){
int temp = arry[j];
arry[j] = arry[j-1];
arry[j-1] = temp;
}
}
}
for (int i = 0; i < arry.length; i++) {
System.out.print(arry[i]+" ");
}
}
//希尔
public static void xiEr(int[] arry){
System.out.println("......");
}
//求最大最小值求和
public static void maxMinSum(int[] arry){
int min = arry[0];
int max = arry[0];
int sum = 0;
for (int i = 0; i < arry.length; i++) {
sum = sum + arry[i];
if(max<arry[i]){
max = arry[i];
}
if(min>arry[i]){
min = arry[i];
}
}
System.out.println("max = "+max);
System.out.println("min = "+min);
System.out.println("sum = "+sum);
}
}
import java.util.Random;
public class getMaxMin_Number {
public static void main(String[] args) {
int[] arry = new int[20];
Random r = new Random();
//给数组 随机赋值
for (int i = 0; i < arry.length; i++) {
arry[i] = r.nextInt(100);
System.out.print(arry[i]+" ");
}
System.out.println();
System.out.println("降序排列的结果: ");
sort(arry);
System.out.println();
System.out.println("冒泡排序的结果: ");
maoPao(arry);
System.out.println();
System.out.println("选择排序的结果: ");
xuanZe(arry);
System.out.println();
System.out.println("插入排序的结果: ");
chaRu(arry);
System.out.println();
System.out.println("希尔排序的结果: ");
xiEr(arry);
System.out.println();
System.out.println("最大值最小值和值: ");
maxMinSum(arry);
}
//降序
private static void sort(int[] arry) {
int t=0;
for(int i=0;i<arry.length-1;i++){
for(int m=i+1;m<arry.length;m++) {
if(arry[i]>arry ){
t=arry[i];
arry[i]=arry ;
arry =t;
}
}
}
for(int i=0;i<arry.length;i++){
System.out.print(arry[arry.length-1-i]+" ");
}
}
//冒泡
public static void maoPao(int[] arry){
int temp =0;
for (int i = 0; i < arry.length-1; i++) {
for (int j = i+1; j < arry.length; j++) {
if(arry[i]>arry[j]){
temp = arry[j];
arry[j] = arry[i];
arry[i] = temp;
}
}
}
for (int i = 0; i < arry.length; i++) {
System.out.print(arry[i]+" ");
}
}
//选择
public static void xuanZe(int[] arry){
for (int i = 0; i < arry.length; i++) {
int lowerindex = i;
for (int j = i+1; j < arry.length; j++) {
if(arry[j]<arry[lowerindex]){
lowerindex = j;
}
}
int temp = arry[i];
arry[i] = arry[lowerindex];
arry[lowerindex] = temp;
}
for (int i = 0; i < arry.length; i++) {
System.out.print(arry[i]+" ");
}
}
//插入
public static void chaRu(int[] arry){
for (int i = 1; i < arry.length; i++) {
for (int j = i; j > 0; j--) {
if(arry[j]<arry[j-1]){
int temp = arry[j];
arry[j] = arry[j-1];
arry[j-1] = temp;
}
}
}
for (int i = 0; i < arry.length; i++) {
System.out.print(arry[i]+" ");
}
}
//希尔
public static void xiEr(int[] arry){
System.out.println("......");
}
//求最大最小值求和
public static void maxMinSum(int[] arry){
int min = arry[0];
int max = arry[0];
int sum = 0;
for (int i = 0; i < arry.length; i++) {
sum = sum + arry[i];
if(max<arry[i]){
max = arry[i];
}
if(min>arry[i]){
min = arry[i];
}
}
System.out.println("max = "+max);
System.out.println("min = "+min);
System.out.println("sum = "+sum);
}
}
0 0
- java一维数组排序及算法
- java(4)--排序算法及二维数组
- java 一维数组排序
- 数组及排序算法
- Java数组排序算法
- 【黑马程序员】 学习笔记 - Java数组及排序算法
- 黑马程序员 Java基础<一> 数组及排序
- 算法分析(一)堆排序原理及java实现
- java有关数组排序算法
- Java 数组排序及查找
- java基础-数组及排序
- 一维数组排序
- 一维数组排序
- java基础 数组及数组排序方法
- java数组、排序算法、查找算法详解
- js一维数组转二维数组 及 二维数组排序
- Java实现排序算法(一)
- 排序算法JAVA实现一
- 2016年TI杯电子设计大赛赛后总结
- Android样式的开发:selector
- 汇编语言、指令集
- mac搭建appium测试环境
- Free IDEs for Flex and AIR Development
- java一维数组排序及算法
- HDU-哈密顿绕行世界问题
- Flash/ActionScript3 “Programming” under Ubuntu
- ANSI(字符集) and Unicode(字符集) and UTF-8(编码Unicode字符集)
- 【MySQL性能优化】MySQL查询优化器源码分析
- Javascript ajax封装 并重载
- (2016年8月2号) 台风 从零开始
- Android Activity之间跳转出现短暂黑屏的处理方法(转)
- MJExtension模型互转框架点简单使用