• Levenshtein Distance Algorithm

    Levenshtein Distance Algorithm0

    Hello my fellow Padawans  Couple days ago I had to use an algorithm for comparing string and I want to write something about Levenshtein Algorithm. This algorithm is for measure the metric distance between 2 string text. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions)

  • Audi AI:ME first look at CES 2020

    Audi AI:ME first look at CES 20201

    The AI:Me (pronounced Amy) is the automaker’s “empathetic mobility partner.” With level-4 abilities, the self-driving vehicle is built for dense urban environments. Its small footprint makes nimble enough to cruise down small roads and park in tiny spaces.

  • Apple September Event 2019

    Apple September Event 20190

    Innovation takes the stage September 10, 2019. Check out the all-new iPhone 11 Pro, iPhone 11, Apple Watch Series 5, and iPad. And get the latest on Apple Arcade and Apple TV+.

  • Microsoft Edge Chromium new browser for Windows and Mac OS

    Microsoft Edge Chromium new browser for Windows and Mac OS0

    Microsoft officially launched new Edge Chromium browser for Windows and MacOS. A stable version of Edge Chromium is available for everyone to download here. Microsoft initially targeting Edge at enterprise users of Windows and macOS , but consumers will be able to manually install it . In coming months, Edge Chromium will be available with

  • Sony Vision-S Smart Car

    Sony Vision-S Smart Car0

    In first days of 2020, Sony announced their unexpected product at Consumer Electronics Show (CES) 2020 . It’s a car named, Sony Vision-S Smart Car. The Vision-S model is roadworthy, but its intention was more to show off Sony’s tech features that can be sold as all-in-one options for vehicles. Those features include sensors, imaging

  • Javascript Algoritmaları – Bubble Sort

    Javascript Algoritmaları – Bubble Sort0

    Bubble Sort okullarda öğretilen ilk algoritmadır diyebiliriz. Bu algoritma verim olarak en verimsiz sıralama algoritmasıdır ancak yapısal olarak anlaşılması en kolayıdır. Buradaki temel fikir sıralanacak dizi içindeki elemanların karşılaştırılmasıdır. Her seferinde 2 eleman karşılaştırılır ve sonrasında yerleri değişmeden önce doğru sıradalarmı diye emin olur. Basit olarak : *Ilk eleman ile ikinciyi karşılaştırır*Eğer ilk eleman ikinci elemandan