2-Laboratoriya ishi. Mavzu: Oddiy saralash algoritmlari. Saralash va izlash nima uchun kerak?

public class tajriba_ishi_2 {
public static void main(String[] args){
Scanner myObj = new Scanner(System.in) ;
int n = myObj.nextInt() ;
int a[] = new int[n+1] ;
for (int i=1;i<=n;i++){
a[i] = myObj.nextInt() ;
}
int x,p = 1 ;
for (int i=1;i
for (int j=i+1;j<=n;j++){
if (a[i]>a[j]){
x = a[i] ;
a[i] = a[j] ;
a[j] = x ;
}
}


}
p = a[n]*a[n-1]*a[n-2] ;
System.out.println(p);
}
}


4-Topshiriq
Butun sonlar bir-biridan ‘:’ orqali ajratilib berilgan. Sizning vazifangiz barcha qatnashgan sonlarni qiymatlari kamaymaslik tartibida saralab chiqarishdan iborat.
Kiruvchi ma’lumotlar
Birinchi qatorda sonlar ‘:’ belgisi orqali ajratib berilgan. Kamida bitta, ko’pi bilan 500 son qatnashadi va ikkita son orasida faqat bitta ‘:’ belgisi qatnashishi mumkin. Sonlar qiymatlari butun va 0 dan 10⁹ gacha bo’lishi mumkin..
Chiquvchi ma’lumotlar
Saralangan sonlarni birinchi qatorda bitta probel bilan ajratib chiqaring.
package com.company;
import java.util.Scanner;
public class tajriba_ishi_2 {
public static void main(String[] args){
Scanner myObj = new Scanner(System.in) ;
String text = myObj.nextLine() ;
text+=":" ;
int array [] = new int[text.length()] ;
int cnt = 0 ;
String r="" ;
for (int i=0;i
if (text.charAt(i)!=':'){
r+=text.charAt(i) ;
}
else {
cnt++ ;
array[cnt] = Integer.parseInt(r) ;
r="" ;
}
}
int x ;
for (int i=1;i
for (int j=i+1;j<=cnt;j++){
if (array[i]>array[j]){
x = array[i] ;
array[i] = array[j] ;
array[j] = x ;
}
}
}
for (int i=1;i<=cnt;i++){
System.out.print(array[i]+" ");
}
}
}