{"id":5015,"date":"2021-08-29T12:13:52","date_gmt":"2021-08-29T12:13:52","guid":{"rendered":"https:\/\/serkanseker.com\/?p=5015"},"modified":"2021-08-29T12:13:52","modified_gmt":"2021-08-29T12:13:52","slug":"algoritma-nedir","status":"publish","type":"post","link":"https:\/\/serkanseker.com\/tr\/algoritma-nedir\/","title":{"rendered":"Algoritmalara K\u0131sa Bir Giri\u015f"},"content":{"rendered":"
\n

Algoritma<\/strong>, belli bir problemi \u00e7\u00f6zmek veya belirli bir amaca ula\u015fmak i\u00e7in tasarlanan yola, takip edilen i\u015flem basamaklar\u0131d\u0131r. Di\u011fer bir ifadeyle, beklenen sonu\u00e7lar\u0131 elde etmek i\u00e7in bir i\u015fin nas\u0131l y\u00fcr\u00fct\u00fclece\u011fini ad\u0131m ad\u0131m tan\u0131mlayan bir dizi kural(talimat) anlam\u0131na gelir.\u00a0<\/p>\n

Algoritmalar belirli bir ba\u015flang\u0131c\u0131 ve sonu olan bir sonlu i\u015flemler k\u00fcmesidir. Amaca ula\u015fmak i\u00e7in i\u015flenecek \u00e7\u00f6z\u00fcm yollar\u0131 ve ad\u0131mlar belirlenir ve algoritma bu ad\u0131mlar\u0131 s\u0131rayla takip ederek istenen \u00e7\u00f6z\u00fcme ula\u015f\u0131r. <\/p>\n

Algoritman\u0131n ne oldu\u011funu daha iyi anlamak i\u00e7in yemek pi\u015firme \u00f6rne\u011fine bakal\u0131m. Yeni bir yemek pi\u015firmek i\u00e7in talimatlar\u0131 okuyup ad\u0131mlar\u0131 s\u0131rayla uygulad\u0131\u011f\u0131n\u0131z zaman sonu\u00e7 yeni pi\u015fmi\u015f bir yemektir. Yani tarif amac\u0131na ula\u015fm\u0131\u015ft\u0131r. Benzer \u015fekilde, algoritmalar da beklenen \u00e7\u0131kt\u0131y\u0131 elde etmek i\u00e7in programlamada bir g\u00f6revi yerine getirmeye yard\u0131mc\u0131 olur. <\/p>\n

Algoritmalar genellikle bilgisayar bilimlerinde kullan\u0131l\u0131r. T\u00fcm programlama dillerinin temeli algoritmalara dayan\u0131r. Dolay\u0131s\u0131yla algoritmalar bir programlama dili vas\u0131tas\u0131yla\u00a0bilgisayarlar\u00a0taraf\u0131ndan i\u015fletilebilirler. Tasarlanan bir algoritma dilden ba\u011f\u0131ms\u0131zd\u0131r, yani herhangi bir dilde uygulanabilecek basit talimatlar\u0131n \u00e7\u0131kt\u0131s\u0131 beklendi\u011fi gibi ayn\u0131 olacakt\u0131r.<\/p>\n

\u0130lk algoritma,\u00a0el-H\u00e2rizm\u00ee\u00a0taraf\u0131ndan \u201cHisab el-cebir ve el-mukabala\u201d kitab\u0131nda sunulmu\u015ftur. Algoritma s\u00f6zc\u00fc\u011f\u00fc de\u00a0el-H\u00e2rizm\u00ee\u2019nin isminin Avrupal\u0131larca telaffuzundan do\u011fmu\u015ftur.<\/p>\n

Algoritmalar\u0131n \u00d6zellikleri Nelerdir?<\/span><\/h2>\n

\u015eunu belirtmek gerekir ki, programlama i\u00e7in t\u00fcm yaz\u0131l\u0131 talimatlar bir algoritma de\u011fildir.\u00a0Baz\u0131 komutlar\u0131n algoritma olabilmesi i\u00e7in a\u015fa\u011f\u0131daki \u00f6zelliklere sahip olmas\u0131 gerekir:<\/p>\n

    \n
  1. A\u00e7\u0131k ve kesin olmal\u0131d\u0131r<\/strong>: Bir algoritma a\u00e7\u0131k ve net olmal\u0131d\u0131r.\u00a0Ad\u0131mlar\u0131n\u0131n her biri t\u00fcm y\u00f6nleriyle a\u00e7\u0131k olmal\u0131 ve tek bir anlama gelmelidir.<\/li>\n
  2. Girdiler iyi tan\u0131mlanmal\u0131d\u0131r<\/strong>: Bir algoritman\u0131n girdileri iyi tan\u0131mlanm\u0131\u015f girdiler olmal\u0131d\u0131r.<\/li>\n
  3. \u00c7\u0131kt\u0131lar iyi tan\u0131mlanmal\u0131d\u0131r:<\/strong>\u00a0Algoritma, hangi \u00e7\u0131kt\u0131n\u0131n elde edilece\u011fini a\u00e7\u0131k\u00e7a tan\u0131mlamal\u0131d\u0131r.<\/li>\n
  4. Sonlu olmal\u0131d\u0131r:<\/strong>\u00a0Algoritma sonlu olmal\u0131d\u0131r, yani sonsuz d\u00f6ng\u00fc veya benzeri ile sonu\u00e7lanmamal\u0131d\u0131r.<\/li>\n
  5. Uygulanabilir olmal\u0131d\u0131r:<\/strong>\u00a0Algoritma, mevcut kaynaklara g\u00f6re y\u00fcr\u00fct\u00fclebilecek \u015fekilde basit, genel ve pratik olmal\u0131d\u0131r.\u00a0Gelecekteki bir teknolojiyi veya herhangi bir \u015feyi i\u00e7ermemelidir.<\/li>\n
  6. Dilden ba\u011f\u0131ms\u0131z olmal\u0131d\u0131r:<\/strong>\u00a0Tasarlanan algoritma dilden ba\u011f\u0131ms\u0131z olmal\u0131d\u0131r. Yani ad\u0131mlar herhangi bir dilde uygulanabilir \u015fekilde olmal\u0131d\u0131r. Tabi ki \u00e7\u0131kt\u0131 beklendi\u011fi gibi ayn\u0131 olacakt\u0131r.<\/li>\n<\/ol>\n

    Algoritmalar Nas\u0131l Tasarlan\u0131r?<\/span><\/h2>\n

    Algoritma yazmak i\u00e7in \u00f6n ko\u015ful olarak a\u015fa\u011f\u0131dakilere ihtiya\u00e7 vard\u0131r:\u00a0<\/p>\n

      \n
    1. Problem<\/strong>: Bir algoritma ile \u00e7\u00f6z\u00fclmesi gereken problem.<\/li>\n
    2. K\u0131s\u0131tlar(Constraints)<\/strong>: Problemi \u00e7\u00f6zerken g\u00f6z \u00f6n\u00fcnde bulundurulmas\u0131 gereken problemin k\u0131s\u0131tlar\u0131.<\/li>\n
    3. Girdi<\/strong>: Problemi \u00e7\u00f6zmek i\u00e7in al\u0131nacak girdi.<\/li>\n
    4. \u00c7\u0131kt\u0131<\/strong>: Problem \u00e7\u00f6z\u00fcld\u00fc\u011f\u00fcnde beklenen \u00e7\u0131kt\u0131.<\/li>\n
    5. \u00c7\u00f6z\u00fcm(Solution)<\/strong>: Verilen k\u0131s\u0131tlamalarda bu sorunun \u00e7\u00f6z\u00fcm\u00fc.<\/li>\n<\/ol>\n

      Daha sonra yukar\u0131daki parametreler yard\u0131m\u0131yla problemi \u00e7\u00f6zecek \u015fekilde algoritma yaz\u0131l\u0131r.<\/p>\n

      \u00d6rnek:\u00a0Girilen 3 say\u0131n\u0131n toplam\u0131n\u0131 yazd\u0131r\u0131n<\/span><\/h3>\n

      1) \u00d6n Ko\u015fullar\u0131n Sa\u011flanmas\u0131<\/strong><\/span><\/h4>\n

      Yukar\u0131da belirtti\u011fim gibi, bir algoritma yazabilmek i\u00e7in \u00f6n ko\u015fullar\u0131n\u0131n yerine getirilmesi gerekir.\u00a0<\/p>\n

        \n
      1. Bu algoritma ile \u00e7\u00f6z\u00fclmesi gereken problem<\/strong>\u00a0: 3 say\u0131 girin ve toplamlar\u0131n\u0131 yazd\u0131r\u0131n.<\/li>\n
      2. Problemi \u00e7\u00f6zerken dikkat edilmesi gereken problemin k\u0131s\u0131tlar\u0131<\/strong>\u00a0: Rakamlar sadece numeric olmal\u0131 ve ba\u015fka karakter i\u00e7ermemelidir.<\/li>\n
      3. Problemi \u00e7\u00f6zmek i\u00e7in al\u0131nacak girdi:<\/strong>\u00a0Eklenecek \u00fc\u00e7 say\u0131.<\/li>\n
      4. Problem \u00e7\u00f6z\u00fcld\u00fc\u011f\u00fcnde beklenen \u00e7\u0131kt\u0131:<\/strong>\u00a0Girdi olarak al\u0131nan \u00fc\u00e7 say\u0131n\u0131n toplam\u0131.<\/li>\n
      5. Verilen k\u0131s\u0131tlamalarda bu problemin \u00e7\u00f6z\u00fcm\u00fc:<\/strong>\u00a0Girilen 3 say\u0131n\u0131n toplam\u0131.\u00a0\u2018+\u2019 operat\u00f6r\u00fc yard\u0131m\u0131yla veya bit baz\u0131nda veya ba\u015fka bir y\u00f6ntemle yap\u0131labilir.<\/li>\n<\/ol>\n

        2) Algoritmay\u0131 Tasarlama<\/strong> <\/span><\/h4>\n

        \u015eimdi yukar\u0131daki \u00f6n ko\u015fullar\u0131n yard\u0131m\u0131yla algoritmay\u0131 tasarlayal\u0131m:<\/p>\n

          \n
        1. BA\u015eLAT<\/li>\n
        2. num1, num2 ve num3 olmak \u00fczere 3 tane tam say\u0131 de\u011fi\u015fkeni tan\u0131mlay\u0131n.<\/li>\n
        3. num1, num2 ve num3 de\u011fi\u015fkenlerinde girdi olarak eklenecek 3 say\u0131y\u0131 al\u0131n.<\/li>\n
        4. 3 say\u0131n\u0131n toplam\u0131n\u0131 depolamak i\u00e7in bir tam say\u0131 de\u011fi\u015fkeni(sum) tan\u0131mlay\u0131n.<\/li>\n
        5. 3 say\u0131y\u0131 ekleyin ve sonucu sum de\u011fi\u015fkeninde saklay\u0131n.<\/li>\n
        6. sum de\u011fi\u015fkeninin de\u011ferini yazd\u0131r\u0131n.<\/li>\n
        7. SON<\/li>\n<\/ol>\n

          3) Algoritmay\u0131 Uygulayarak Test Etme<\/strong><\/span><\/h4>\n

          Algoritmay\u0131 test etmek i\u00e7in Java dilinde uygulayal\u0131m:<\/p>\n

          import java.util.Scanner;\nclass SumOfThreeNumbers{\n\tpublic static void main(String args[]){\n\t\tint num1,num2,num3;\n\t\tSystem.out.println("L\u00fctften 3 tane tamsay\u0131 de\u011feri girin");\n\t\tScanner in = new Scanner(System.in);\n\t\tnum1 = in.nextInt();\n\t\tnum2 = in.nextInt();\n\t\tnum3 = in.nextInt();\n\t\tint sum=num1+num2+num3;\n\t\tSystem.out.println("Sonu\u00e7: "+sum);\n\t}\n}<\/code><\/pre>\n
          Program\u0131n \u00e7\u0131kt\u0131s\u0131 a\u015fa\u011f\u0131daki gibi olacakt\u0131r:<\/p>\n
          L\u00fctften 3 tane tamsay\u0131 de\u011feri girin\n12\n40\n7\nSonu\u00e7: 59<\/code><\/pre>\n
          Algoritma Analizi<\/span><\/h2>\n
          Priori Analizi<\/strong> (Priori Analysis<\/strong>)<\/span><\/h3>\n
          \u201cPriori\u201d, \u201c\u00f6nce\u201d anlam\u0131na gelir.\u00a0Bu nedenle Priori analizi, algoritman\u0131n uygulanmas\u0131ndan \u00f6nce kontrol edilmesi anlam\u0131na gelir.\u00a0Bu analizde algoritma teorik ad\u0131mlar \u015feklinde yaz\u0131ld\u0131\u011f\u0131nda kontrol edilir.\u00a0Algoritman\u0131n verimlili\u011fi i\u015flemci h\u0131z\u0131 gibi di\u011fer t\u00fcm fakt\u00f6rlerin sabit oldu\u011fu ve uygulama \u00fczerinde hi\u00e7bir etkisi olmad\u0131\u011f\u0131 varsay\u0131larak \u00f6l\u00e7\u00fcl\u00fcr.\u00a0Bu genellikle algoritma tasar\u0131mc\u0131s\u0131 taraf\u0131ndan yap\u0131l\u0131r.\u00a0Algoritma karma\u015f\u0131kl\u0131\u011f\u0131 bu y\u00f6ntemle belirlenir.<\/p>\n
          Posterior<\/strong><\/strong> Analiz<\/strong> (Posterior Analysis<\/strong>)<\/span><\/h3>\n
          \u201cPosterior\u201d, \u201csonra, arka\u201d anlamlar\u0131na gelir.\u00a0Dolay\u0131s\u0131yla Posterior Analiz, algoritman\u0131n uygulanmas\u0131ndan sonra kontrol edilmesidir.\u00a0Algoritma herhangi bir programlama dilinde uygulanarak ve \u00e7al\u0131\u015ft\u0131r\u0131larak kontrol edilir.\u00a0Bu analiz, do\u011fruluk, gerekli alan, harcanan zaman vb. hakk\u0131nda ger\u00e7ek analiz raporunun al\u0131nmas\u0131na yard\u0131mc\u0131 olur.<\/p>\n
          \"Algoritma
          Algoritma Nedir?<\/figcaption><\/figure>\n
          Algoritmalarda Karma\u015f\u0131kl\u0131k<\/span><\/h2>\n