Mehmet Karataş LogoMehmet Karataş
HomeServicesProjectsBlogAboutFunToolsCourses (TR)
Contact
Mehmet Karataş LogoMehmet Karataş

Contact

I build solutions with modern web and mobile technologies.

Contact
benmuhendisiniz@gmail.com

Diyarbakır, Türkiye — Remote services across Türkiye and abroad

Quick links

  • Home
  • Services
  • Projects
  • Blog
  • About
  • Contact
  • Fun
  • Tools
  • Courses (TR)
  • CV / Résumé (TR)

Services

  • Web Development
  • Mobile App Development
  • Custom Software Development
  • E-Commerce Websites
  • SEO and Online Visibility
  • Software and Project Consulting

© 2026 Mehmet Karataş. All rights reserved.

Privacy noticeCookie policy
HomeProjectsBlogServicesAboutFunToolsCourses (TR)
Algoritma atölyesi

SEARCHING / İNTERAKTİF DENEY

Linear Search

Dizinin başından sonuna kadar her elemanı tek tek kontrol eden basit bir arama algoritmasıdır.

Ortalama O(n)
Bubble SortQuick SortMerge SortSelection SortInsertion SortHeap SortBinary SearchLinear Search
Deney hazır
STEP 0 / 14
Comparisons00
Kalan aralık12
Target value48
64
0
22
1
81
2
39
3
15
4
73
5
48
6
92
7
31
8
56
9
10
10
67
11
Comparisons Moves Pivot / orta Found
Hazır

The array is ready. Start the first step.

Sıfırlama, aynı diziyi başlangıç durumuna getirir.

KODUN AKIŞI

Şu anda ne oluyor?

  1. 01Start at the beginning of the array
  2. 02Compare the current value with the target
  3. 03If equal, the target is found; otherwise continue
  4. 04If the array ends, the target was not found

MALİYET ANALİZİ

Algorithm properties

Best case
O(1)
Ortalama
O(n)
Worst case
O(n)
Extra space
O(1)

İndeksler sıfırdan başlar. Aranan değer dizide olmayabilir. Karmaşıklıklar algoritmaya aittir; görselleştirme geçmişi ek bellek kullanır.