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

SORTING / İNTERAKTİF DENEY

Merge Sort

Repeatedly splits the array in two, then merges the parts in sorted order. It is a stable and efficient sorting algorithm.

Ortalama O(n log n)
Bubble SortQuick SortMerge SortSelection SortInsertion SortHeap SortBinary SearchLinear Search
Deney hazır
STEP 0 / 99
Comparisons00
Swaps00
Writes00
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 Sorted
Hazır

The array is ready. Start the first step.

TEMPORARY ARRAY

Birleştirme sırasında seçilen değerler burada birikir.

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

KODUN AKIŞI

Şu anda ne oluyor?

  1. 01Split the range in half and sort both parts
  2. 02Compare the first remaining values in both parts
  3. 03Write the smaller value to the temporary array
  4. 04Copy the temporary array back to the original range

MALİYET ANALİZİ

Algorithm properties

Best case
O(n log n)
Ortalama
O(n log n)
Worst case
O(n log n)
Extra space
O(n)
Kararlı sıralama
Evet

Yazma sayısı, geçici diziye ve ana diziye yapılan aktarımları içerir. Karmaşıklıklar algoritmaya aittir; görselleştirme geçmişi ek bellek kullanır.