Amaliy matematika va informatika kafedrasi dasturlash asoslari fanidan

2.2 Consol oplication muhitida dasturlar yaratish:

1-dastur: Berilgan sonlar ichidan eng kichik sonlarni topish.dasturini tuzing.

Dasturni C# dasturlash tilidagi ilovasi:

using System;

using System.Text;

namespace dastur_1

{

class Program

{

static void Main(string[] args)

{

int n, i, s = 0, s1 = 0;

Console.Write("son kiritng ! N=");

n = int.Parse(Console.ReadLine());

int[] a;

a = new

int[n]; for (i = 0; i < n; i++)

{

Console.Write("a[" + i + "]=");

a[i] = int.Parse(Console.ReadLine());

}

s = a[0];

for (i = 0; i < n; i++) if (a[i] < s) { s = a[i]; s1 = (i + 1); }

Console.Write("eng kichik son s= " + s);

Console.ReadKey();

}

}

}

Natija:
2-dastur: Berilgan sonli massivlar ichidan ikkiga va yettiga karrali sonllarni topish dasturini tuzing.

Dasturni C# dasturlash tilidagi ilovasi:

using System;

using System.Text;

namespace dastur_2

{

class Program

{

static void Main(string[] args)

{

int n, i, s = 0, s1 = 0;

Console.Write("son kiritng ! N=");

n = int.Parse(Console.ReadLine());

int[] a;

a = new

int[n]; for (i = 0; i < n; i++)

{

Console.Write("a[" + i + "]=");

a[i] = int.Parse(Console.ReadLine());

}

for (i = 0; i < n; i++)

{ if ((a[i] %2==0)&&(a[i]%7==0))

{ s1++; Console.Write("Berilgan sonli massivlar ichida ikkiga va yettiga karrrali " + s1 + "-son " + a[i] + "\n"); }

}

if(s1==0)

Console.Write("Berilgan massivlar ichida ikkiga va yettia karrali sonlar yo'q");

Console.ReadKey();

}

}

}

Natija:

3-dastur. natural son berilgan. o’lchamli elementlari butun sonlardan va elementlari qiymati dastlabki ta toq sonlardan tashkil topgan massiv hosil qilib uni chiqarish dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            uint n;

            Console.Write("Natural son kiriting: ");

            n=uint.Parse(Console.ReadLine());

            uint  [] m=new uint[n];

            for (uint i=0;i

            {

                m[i]=2*i+1;

                Console.Write("m["+i+"]="+m[i]+"  ");

            }

            Console.ReadKey(true);

        }

Natija:

4-dastur: natural son berilgan. o’lchamli elementlari butun sonlardan va elementlari qiymati ikkining darajalaridan tashkil topgan massiv hosil qilib uni chiqarish dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            uint n;

            Console.Write("Natural son kiriting: ");

            n=uint.Parse(Console.ReadLine());

            uint  [] m=new uint[n];

            for (uint i=0;i

            {

                m[i]=2*(i+1);

                Console.Write("m["+i+"]="+m[i]+" ");

            }

            Console.ReadKey(true);

        }

Natija:

5-dastur: natural son berilgan, va yana dastlabki elementi va yigindisi bo’lgan arifmetik progressiya. o’lchamli elementlari butun sonlardan va elementlari qiymati berilgan progressiyaning dastlabki ta elementidan tashkil topgan massiv hosil qilib uni chiqarish dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i=0,D;

            Console.Write("Massiv elementlari sonini kiriting: ");

            n=int.Parse(Console.ReadLine()); int  [] m=new int[n];

            Console.Write("Arifmetik progressiyani 1-hadini kiriting: ");

            m[i]=int.Parse(Console.ReadLine());

            Console.Write("Arifmetik progressiyani ayirmasini kiriting: ");

            D=int.Parse(Console.ReadLine());

            Console.Write("m["+i+"]="+m[i]+" ");

            for (i=1;i

            {

                m[i]=m[i-1]+D;

                Console.Write("m["+i+"]="+m[i]+" ");

            }

            Console.ReadKey(true);

        }

    

Natija:

6-dastur: natural son berilgan, va yana dastlabki elementi va maxraji bo’lgan geometik progressiya. o’lchamli elementlari qiymati berilgan progressiyaning dastlabki ta elementidan tashkil topgan massiv hosil qilib uni chiqarish dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i=0; double D;

            Console.Write("Massiv elementlari sonini kiriting: ");

            n=int.Parse(Console.ReadLine()); double  [] m=new double[n];

            Console.Write("Geometik progressiyani 1-hadini kiriting: ");

            m[i]=int.Parse(Console.ReadLine());

            Console.Write("Geometik progressiyani maxrajini kiriting: ");

            D=double.Parse(Console.ReadLine());

            Console.Write("m["+i+"]="+m[i]+"  ");

            for (i=1;i

            {

                m[i]=m[i-1]*D;

                Console.Write("m["+i+"]="+m[i]+"  ");

            }

            Console.ReadKey(true);

        }

    

Natija:
7-dastur: natural son berilgan. o’lchamli elementlari butun sonlardan va elementlari qiymati fibonachchi sonlar ketma-ketligining dastlabki ta elementidan tashkil topgan massiv hosil qilib uni chiqarish dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i;

            Console.Write("Massiv elementlari sonini kiriting: ");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];m[0]=1;m[1]=1;

            Console.Write("m["+0+"]="+m[0]+"  m["+1+"]="+m[1]+"  ");

            for (i=2;i

            {

                m[i]=m[i-1]+m[i-2];

                Console.Write("m["+i+"]="+m[i]+"  ");

            }

            Console.ReadKey(true);

        }

Natija:

8-dastur: , , butun sonlar berilgan. o’lchamli elementlari butun sonlardan va birinchi elementi ga, ikkinchi elementi ga teng, qolgan elementlari qiymatlari o’zidan oldingi barcha element yig’indisidan tashkil topgan massiv hosil qilib va uni chiqarish dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i,a,b;

            Console.Write("Massiv elementlari sonini kiriting: ");

            n=int.Parse(Console.ReadLine()); 

            Console.Write("a ni kiriting: ");

            a=int.Parse(Console.ReadLine());

            Console.Write("b ni kiriting: ");

            b=int.Parse(Console.ReadLine());

            int  [] m=new int[n];m[0]=a;m[1]=b;m[2]=a+b;

            Console.Write("m[0]="+m[0]+"  m[1]="+m[1]+"  m[2]="+m[2]);

            for (i=3;i

            {

                m[i]=2*m[i-1];

                Console.Write("  m["+i+"]="+m[i]);

            }

            Console.ReadKey(true);

        }

Natija:

9-dastur: o’lchamli massiv berilgan. Uning elementlarini teskari tartibda chiqarish dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i,j;

            Console.Write("Massiv elementlari sonini kiriting: ");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }

            for (j=n-1;j>=0;j--) Console.Write("m["+j+"]="+m[j]+"  ");

            Console.ReadKey(true);

        }

    

Natija:
10-dastur: o’lchamli butun tipli massiv berilgan. Massiv elementlari orasidan toqlarini tartib raqamini o’sish tartibida chiqarish va ular soni ni aniqlash dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i,j;

            Console.Write("Massiv elementlari sonini kiriting: ");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }

            i=0;  

            for (j=0;j

            {i++;Console.Write(m[j]+"  ");}

            Console.Write("\nMassivning toq elementlari soni: "+i);     

            Console.ReadKey(true);

        }

Natija:

11-dastur: ta butun sondan tashkil topgan massiv berilgan. Massiv elementlari orasidan juftlarining indekslarini kamayish tartibida chiqarish va ularning soni ni aniqlash dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,k=0,i;

            Console.Write("Massiv elenemtlari sonini kiriting:");

            n=int.Parse(Console.ReadLine());

            int [] a = new int[n];

            for (i=0; i

            {

                Console.Write("a["+i+"]=");

                a[i]=int.Parse(Console.ReadLine());

            } i=n;

            do 

            {

                i--;

                if (a[i]%2==0) {Console.Write(a[i]+" ");k++;}

            } while(i>0);

            Console.WriteLine("\nJuft sonlar miqdori: "+k);

            Console.ReadKey(true);

        }

Natija:

12-dastur: ta butun sondan tashkil topgan massiv berilgan. Massiv elementlari orasidan avval juftlarining indekslarini o’sish tartibida, keyin toqlarining indekslarini kamayish tartibida chiqarish dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i,j;

            Console.Write("Massiv elementlari sonini kiriting: ");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }

            for (j=0;j

            for (j=n-1;j>=0;j--) if (m[j]%2==1) Console.Write(m[j]+"  ");

            Console.ReadKey(true);

        }

Natija:

13-dastur: o’lchamli massiv va natural son berilgan . Massiv ga karrali elementlarini tartib bilan chiqarish dasturi tuzilsin: . Shart operatoridan foydalanilmasin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i,j,k;

            Console.Write("Massiv elementlari sonini kiriting: ");

            n=int.Parse(Console.ReadLine()); 

            Console.Write("k ni kiriting: 1<=k<="+n+" k=");

            k=int.Parse(Console.ReadLine());

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }

            for (j=k;j

            Console.ReadKey(true);

        }

Natija:

14-dastur: o’lchamli massiv berilgan (-juft son). Massiv juft indeksli elementlarini tartib bilan chiqarish dasturi tuzilsin: . Shart operatoridan foydalanilmasin.

Dasturning C# dagi ko’rinishi:

        {

            int i,n,j;

            Console.Write("Massiv elementlari sonini kiriting: (n juft son) ");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }

            for (j=1;j

            Console.ReadKey(true);

        }

Natija:

15-dastur: o’lchamli massiv berilgan (-toq son). Massiv toq indeksli elementlarini tartib bilan chiqarish dasturi tuzilsin: . Shart operatoridan foydalanilmasin.

Dasturning C# dagi ko’rinishi:

        {

            int i,n,j;

            Console.Write("Massiv elementlari sonini kiriting: (n toq son) ");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }

            for (j=n-1;j>=0;j-=2) Console.Write(m[j]+"  ");

            Console.ReadKey(true);

        }

Natija:

16-dastur: o’lchamli massiv berilgan. Avval massiv juft indeksli elementlarini keyin toq indeksli elementlarini tartib bilan chiqarish dasturi tuzilsin: . Shart operatoridan foydalanilmasin.

Dasturning C# dagi ko’rinishi:

        {

            int i,n,j;

            Console.Write("Massiv elementlari sonini kiriting: n=");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }

            for (j=1;j

            for (j=0;j

            Console.ReadKey(true);

        }

Natija:

17-dastur: o’lchamli massiv berilgan. Avval massiv toq indeksli elementlarini indekslarini o’sish tartibida keyin juft indeksli elementlarini kamayish tartibida chiqarish dasturi tuzilsin: . Shart operatoridan foydalanilmasin.

Dasturning C# dagi ko’rinishi:

        {

            int i,n,j;

            Console.Write("Massiv elementlari sonini kiriting: n=");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }  

            for (j=0;j

            while (j

            for (j=j-2;j>0;j-=2) Console.Write(m[j]+"  ");

            Console.ReadKey(true);

        }

Natija:

18-dastur: o’lchamli massiv berilgan. Uning elementlarini quyidagi tartibda chiqarish dasturi tuzilsin: .

Dasturning C# dagi ko’rinishi:

        {

            int i,n,j;double d;

            Console.Write("Massiv elementlari sonini kiriting: n=");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }  

            for (j=0;j

            Console.Write(m[j]);

            Console.ReadKey(true);

        }

Natija:

19-dastur: o’lchamli massiv berilgan. Uning elementlarini quyidagi tartibda chiqarish dasturi tuzilsin: .

Dasturning C# dagi ko’rinishi:

        {

            int i,n,j,k;

            Console.Write("Massiv elementlari sonini kiriting: n=");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }  k=0;i=n;

            for (j=0;j

            {

                if (j%4>1) {i--;Console.Write(m[i]+"  ");}

                else {Console.Write(m[k]+"  ");k++;}

            }

            Console.ReadKey(true);

        }

Natija:

20-dastur: O’lchami 10 ga teng bo’lgan, elementlari nolga teng bo’lmagan butun sonli massiv berilgan. tengsizlikni qanoatlantiruvchi birinchi elementni chiqarish dasturi tuzilsin. Agar bunday element bo’lmasa 0 chiqarilsin.

Dasturning C# dagi ko’rinishi:

        {

            int i,n; 

            Console.Write("Massiv elementlari sonini kiriting: n=");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }  

            for (i=0;i

            if (m[n-1]>m[i])

            {

                Console.Write("Oxirgi elementdan kichkina birinchi uchragan element "+m[i]);break;

            }

            Console.ReadKey(true);

        }

Natija:

21-dastur: O’lchami 10 ga teng bo’lgan butun sonli massiv berilgan. tengsizlikni qanoatlantiruvchi oxirgi elementninig tartib nomerini chiqarish dasturi tuzilsin. Agar bunday element bo’lmasa 0 chiqarilsin.

Dasturning C# dagi ko’rinishi:

        {

            int i,n,k=0; bool b=true;

            Console.Write("Massiv elementlari sonini kiriting: n=");

            n=int.Parse(Console.ReadLine()); 

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }  

            for (i=0;im[0] & m[n-1]>m[i]){k=i;b=false;}

            if (!b)Console.Write(m[0]+" dan katta va "+m[n-1]+" kichik oxirgi element nomeri: "+(k+1));

            else Console.Write("Bunday element yo'q. "+k);

            Console.ReadKey(true);

       }

Natija:

22-dastur: o’lchamli massiv va , natural sonlar berilgan . Indeksi dan gacha bo’lgan elementlarining yig’indisini topish dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int i,n,k,l,s=0;

            Console.Write("Massiv elementlari sonini kiriting: n=");

            n=int.Parse(Console.ReadLine()); 

            Console.Write("k ni kiriting: ");

            k=int.Parse(Console.ReadLine());

            Console.Write("l ni kiriting: ");

            l=int.Parse(Console.ReadLine());

            int  [] m=new int[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=int.Parse(Console.ReadLine());

            }  

            for (i=k;i<=l;i++) s+=m[i];

            Console.Write("Massivning "+k+" va "+l+" indekslari orasidagi elementlari yig'indisi: "+s);

            Console.ReadKey(true);

        }

    

Natija:

23-dastur: o’lchamli massiv va , natural sonlar berilgan . Indeksi dan gacha bo’lgan elementlarining o’rta arifmetigini topish dasturi tuzilsin ( va ham).

Dasturning C# dagi ko’rinishi:

        {

            int i,n,k=0,l;double s=0; 

            Console.Write("Massiv elementlari sonini kiriting: n=");

            n=int.Parse(Console.ReadLine()); 

            Console.Write("k ni kiriting: ");

            k=int.Parse(Console.ReadLine());

            Console.Write("l ni kiriting: ");

            l=int.Parse(Console.ReadLine());

            double   [] m=new double[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=double.Parse(Console.ReadLine());

            }  

            for (i=k;i<=l;i++) s+=m[i];s=s/(l-k+1);

            Console.Write("Massivning "+k+" va "+l+" indekslari orasidagi elementlari o'rta arifmetigi: "+s);

            Console.ReadKey(true);

        }

Natija:

24-dastur: o’lchamli massiv va , natural sonlar berilgan . Indeksi dan gacha bo’lgan elementlar ( va ham)dan tashqari barcha elementlarning yig’indisini topish dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int i,n,k,l;double s=0; 

            Console.Write("Massiv elementlari sonini kiriting: n=");

            n=int.Parse(Console.ReadLine()); 

            Console.Write("k ni kiriting: ");

            k=int.Parse(Console.ReadLine());

            Console.Write("l ni kiriting: ");

            l=int.Parse(Console.ReadLine());

            double   [] m=new double[n];

            for (i=0;i

            {

                Console.Write("m["+i+"]=");

                m[i]=double.Parse(Console.ReadLine());

                if (il) s+=m[i];

            } 

            Console.Write("Natija: "+s);

            Console.ReadKey(true);

        }

Natija:

25-dastur: o’lchamli massiv berilgan. Massiv elementlarining lokal maksimumlarining eng kichigini topish dastur tuzilsin (lokal maksimum o’ng va chap qo’shnisidan katta bo’lgan element).

Dasturning C# dagi ko’rinishi:

        {

            int n,i;bool b=true;double min=0;

            Console.Write("Elementlar sonini kiriting: n=");

            n=int.Parse(Console.ReadLine());

            double [] m=new double[n];

            Console.Write("m[1]=");

            m[0]=Convert.ToDouble(Console.ReadLine());

            Console.Write("m[2]=");

            m[1]=Convert.ToDouble(Console.ReadLine());

            for (i=2;i

            { 

                Console.Write("m["+(i+1)+"]=");

                m[i]=Convert.ToDouble(Console.ReadLine());

                if (m[i-1]>m[i-2] & m[i-1]>m[i] & (b|min>m[i-1])) {min=m[i-1];b=false;}

            }

            if (!b)Console.Write("Lokal maximumlar orasida eng kichigi: "+min);

            else Console.Write("Bunday elementlar yo'q.");

            Console.ReadKey(true);

        }

Natija:

26-dastur: o’lchamli massiv berilgan. Massiv elementlarining lokal maksimum yoki lokal minimum bo’lmagan elementlar orasidan eng kattasini topish dasturi tuzilsin (lokal maksimum o’ng va chap qo’shnisidan katta bo’lgan element). Agar massivda bunday element bo’lmasa 0 chiqarilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i=0; double max=0;

            Console.Write("Elementlar sonini kiriting: n=");

            n=int.Parse(Console.ReadLine());

            double [] m=new double[n];

            Console.Write("m[1]=");

            m[0]=Convert.ToDouble(Console.ReadLine());max=m[i];

            Console.Write("m[2]=");

            m[1]=Convert.ToDouble(Console.ReadLine());

            for (i=2;i

            { 

                Console.Write("m["+(i+1)+"]=");

                m[i]=Convert.ToDouble(Console.ReadLine());

                if (!((m[i-1]>m[i-2] & m[i-1]>m[i]) ||(m[i-1]

            }

            if (max

            Console.Write("Lokal maximum yoki lokal minimum bo'lmagan elementlar orasida eng katta: "+max);

            Console.ReadKey(true);

        }

    Natija:

27-dastur: o’lchamli massiv berilgan. Uning elementlari orasidagi o’suvchi oraliqlar sonini aniqlash dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i=0,k=0;bool b=true;

            Console.Write("Elementlar sonini kiriting: n=");

            n=int.Parse(Console.ReadLine());

            double [] m=new double[n];

            Console.Write("m["+(i+1)+"]=");

            m[i]=Convert.ToDouble(Console.ReadLine());

            for (i=1;i

            {  

                Console.Write("m["+(i+1)+"]=");

                m[i]=Convert.ToDouble(Console.ReadLine());

                if (m[i]>=m[i-1]) b=false;

                if (!b & m[i]

            }

            if (!b) {k++;Console.Write("O'suvchi oraliqlar soni: "+k);}

            else Console.Write("Monoton o'suvchi oraliqlar yo'q.");

            Console.ReadKey(true);

        }

Natija:

28-dastur: o’lchamli massiv berilgan. Uning elementlari orasidagi kamayuvchi oraliqlar sonini aniqlash dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i,k=0;bool b=true;

            Console.Write("Elementlar sonini kiriting: n=");

            n=int.Parse(Console.ReadLine());

            double [] m=new double[n];

            Console.Write("m[1]=");

            m[0]=Convert.ToDouble(Console.ReadLine());

            for (i=1;i

            {  

                Console.Write("m["+(i+1)+"]=");

                m[i]=Convert.ToDouble(Console.ReadLine());

                if (m[i]<=m[i-1]) b=false;

                if (!b & m[i]>m[i-1]){b=true;k++;}

            }

            if (!b|k!=0) {k++;Console.Write("Kamayuvchi oraliqlar soni: "+k);}

            else Console.Write("Kamayuvchi oraliqlar yo'q.");

            Console.ReadKey(true);

        }

    

Natija:

29-dastur: o’lchamli massiv berilgan. Uning elementlari orasidagi monoton oraliqlar (massiv elementlari orasidagi o’suvchi yoki kamayuvchi oraliqlar) sonini aniqlash dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,j=0; bool h=true;

            Console.Write("Massiv elementlari sonini kiriting: n=");

            n=int.Parse(Console.ReadLine());

            int [] a=new int[n];

            Console.Write("a[0]=");

            a[0]=int.Parse(Console.ReadLine());

            for (int i=1;i

            {

                Console.Write("a["+i+"]=");

                a[i]=int.Parse(Console.ReadLine());

                h=a[0]

                if (h) {if (a[i-1]>a[i]) {j++;h=false;}}

                else {if (a[i-1]

            }

            Console.Write("Monoton oraliqlar soni: "+j);

            Console.ReadKey(true);

        }

Natija:

30-dastur: o’lchamli massiv va son berilgan. Massiv elementlari orasidagi songa eng yaqin elementni ( ifoda eng kichik bo’ladigan element)aniqlash dasturi tuzilsin.

Dasturning C# dagi ko’rinishi:

        {

            int n,i,k=0;double R,l=0;

            Console.Write("Elementlar sonini kiriting: n=");

            n=int.Parse(Console.ReadLine());

            double [] m=new double[n];

            Console.Write("R ni kiriting: ");

            R=Convert.ToDouble(Console.ReadLine());

            for (i=0;i

            {  

                Console.Write("m["+(i+1)+"]=");

                m[i]=Convert.ToDouble(Console.ReadLine());

                if (i==0|l>Math.Abs(R-m[i])){l=Math.Abs(R-m[i]);k=i;}

            }

            Console.Write("Massivning "+R+" ga eng yaqin elementi: "+m[k]);

            Console.ReadKey(true);

        }

Natija:

XULOSA

Ushbu kurs ishida massivlar haqida malumotlar berilgan bo’lib. Bu kurs ishii kirish 2 ta bob xulosa va foydalanilgan adabiyotlar ro’yxatidan tashkil topgan. Kirish qisimda kurs ishini maqsadi dolzarbligi ko’rsatib o’tilgan. Birinchi bobda zamonaviy dasturlash tillari haqida, massivlar va ularning turlari, C# dasturlash tilida massivlardan qanday foydalanish haqida ma’lumotlar berilib o’tilgan. Ikkinchi bobimizda C# dasturlash tilini Visual studio muhitida dastur oynasini ochish va uning ko’rinishlari va massivlardan foydalanib Consol Application muhitida dasturlar yaratildi.

Bu kurs ishi visual studio muhitida ishlovchilar uchun qo’llanma vazifasini bajara oladi. Undagi ma’lumotlardan foydalangan holda boshqa dasturlar ham yaratish mumkin. Bu kurs ishi endi dasturlash tilini o’rganayotgan dasturchilar uchun massivlarni o’rganish uchun qulay qilib yaratildi.
ADABIYOTLAR RO`YHATI

1. Aripov M.M., Imomov T., Irmuhamedov Z.M. va boshqalar. "Informatika va axborot texnologiyalari". Toshkent, 1-qism. 2002, 2-qism. 2003.

2. Agurov P. "C# Sbornik retseptov" Moskva: Sankt-Peterburg, 2008.

3. Latipova N.X. Chernev D.A. "Dasturlash texnologiyasi" fanidan tajriba ishlarini o'tkazish bo'yicha metodik ko'rsatmalar. T: ToshDTU, 2000.

FOYDALANILGAN SAYTLAR RO’YXATI

1. https://ru.wikipedia.org/wiki/SSL

2. www.GoalKicker.com Free Programming Books

3. www.csharp.ucoz.com

4. www.Google.uz

5. www.Ziyonet.uz

6. www.kutubxona.uz