{"id":5083,"date":"2019-12-04T15:33:46","date_gmt":"2019-12-04T08:33:46","guid":{"rendered":"http:\/\/binus.ac.id\/bandung\/?p=5083"},"modified":"2024-10-15T11:31:54","modified_gmt":"2024-10-15T04:31:54","slug":"algoritma-quick-sort-di-python","status":"publish","type":"post","link":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/","title":{"rendered":"Algoritma Quick Sort di Python"},"content":{"rendered":"

By: Michael Wijaya<\/strong><\/p>\n

Apa itu Algoritma Quick Sort?<\/strong><\/h2>\n

Algoritma Sorting merupakan algoritma yang menempatkan elemen list pada urutan tertentu. Urutan yang paling sering digunakan ialah urutan numerikal dan urutan lexicographical<\/u><\/em><\/strong> (Dalam matematika, urutan leksikografik, biasa dikenal sebagai urutan leksikal atau urutan alfabet, adalah bentuk umum dari urutan alfabet kata yang berdasarkan pada pengurutan huruf depan). Sorting yang efisien sangat dibutuhkan untuk mengoptimisasi penggunaan dari algoritma lain seperti pencarian dan penggabungan yang membutuhkan list terurut untuk berjalan dengan sempurna, yang juga sering digunakan untuk Canonicalisisasi<\/u> <\/em><\/strong>(membakukan) data dan menghasilkan output yang dapat dibaca manusia.<\/p>\n

Salah satu jenis algoritma sorting adalah Quick Sort. Quick Sort adalah salah satu algoritma pengurutan data yang paling cepat, yaitu dengan membagi list menggunakan sebuah pivot. Quick Sort juga menggunakan rekursif dalam algoritmanya. Data yang kurang dari pivot sudah ditentukan ditaruh disebelah kirinya pivot sedangkan data yang lebih besar dari pivot maka ditaruh disebelah kanan pivot.<\/p>\n

#berikut adalah nilai” dari anak” di kelas LB01 urutkanlah dari yang terkecil hingga terbesar (70,55,45,50,30,68,100,98,42,12,54)<\/p>\n

array=[70,55,45,50,30,68,100,98,42,12,54]<\/p>\n

lbK = []
\nsmD = []
\nlbB = []
\nif len(array) > 1:
\npivot = array[0]
\nfor x in array:
\nif x < pivot:
\nlbK.append(x)
\nelif x == pivot:
\nsmD.append(x)
\nelif x > pivot:
\nlbB.append(x)
\na = lbK.sort()
\nb = lbB.sort()
\nprint(lbK+smD+lbB)<\/p>\n

else:
\nprint(‘error’)<\/p>\n

output:<\/p>\n

[12, 30, 42, 45, 50, 54, 55, 68, 70, 98, 100]<\/p>\n

Implementasi Quick Sort di Python<\/b><\/h3>\n

Berikut adalah implementasi <\/span>Quick Sort<\/span><\/i> dalam bahasa Python.<\/span><\/p>\n

# Fungsi untuk melakukan partisi<\/span><\/p>\n

def partition(arr, low, high):<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0pivot = arr[high]\u00a0 # Mengambil elemen terakhir sebagai pivot<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0i = low – 1\u00a0 \u00a0 \u00a0 \u00a0 # Indeks dari elemen yang lebih kecil<\/span><\/p>\n

 <\/p>\n

\u00a0\u00a0\u00a0\u00a0for j in range(low, high):<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0# Jika elemen saat ini lebih kecil atau sama dengan pivot<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if arr[j] <= pivot:<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0i += 1<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0# Tukar elemen arr[i] dan arr[j]<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0arr[i], arr[j] = arr[j], arr[i]<\/span><\/p>\n

 <\/p>\n

\u00a0\u00a0\u00a0\u00a0# Tukar elemen pivot ke posisi yang tepat<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0arr[i + 1], arr[high] = arr[high], arr[i + 1]<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0return i + 1<\/span><\/p>\n

 <\/p>\n

# Fungsi utama quicksort<\/span><\/p>\n

def quicksort(arr, low, high):<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0if low < high:<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0# Pi adalah indeks partisi<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0pi = partition(arr, low, high)<\/span><\/p>\n

 <\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0# Mengurutkan elemen sebelum dan sesudah partisi<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0quicksort(arr, low, pi – 1)<\/span><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0quicksort(arr, pi + 1, high)<\/span><\/p>\n

 <\/p>\n

# Contoh penggunaan<\/span><\/p>\n

arr = [10, 7, 8, 9, 1, 5]<\/span><\/p>\n

n = len(arr)<\/span><\/p>\n

quicksort(arr, 0, n – 1)<\/span><\/p>\n

print(f”Hasil pengurutan: {arr}”)<\/span><\/p>\n

 <\/p>\n

Penjelasan Implementasi<\/h4>\n
    \n
  1. Fungsi partition(arr, low, high)<\/code><\/strong>: Fungsi ini bertanggung jawab untuk menempatkan pivot di posisi yang benar dalam array, yaitu memindahkan elemen-elemen yang lebih kecil dari pivot ke sisi kiri dan elemen-elemen yang lebih besar ke sisi kanan. Elemen pivot dipilih dari elemen terakhir dari array (yaitu arr[high]<\/code>), tetapi teknik lain bisa digunakan untuk memilih pivot.<\/li>\n
  2. Fungsi quicksort(arr, low, high)<\/code><\/strong>: Fungsi ini mengimplementasikan logika utama Quick Sort<\/em>, yaitu memanggil fungsi partition<\/code> untuk memecah array dan kemudian melakukan rekursi pada subdaftar di kiri dan kanan pivot.<\/li>\n
  3. Contoh penggunaan<\/strong>: Dalam contoh ini, kita memiliki array [10, 7, 8, 9, 1, 5]<\/code>, dan setelah dilakukan pengurutan menggunakan Quick Sort<\/em>, array tersebut akan menjadi [1, 5, 7, 8, 9, 10]<\/code>.<\/li>\n<\/ol>\n

    Memilih Pivot<\/b><\/h3>\n

    Pemilihan pivot adalah aspek yang sangat penting dalam <\/span>Quick Sort<\/span><\/i>. Pilihan pivot yang buruk dapat menghasilkan pembagian yang tidak seimbang pada setiap iterasi, yang meningkatkan waktu eksekusi hingga mencapai O(n2)O(n^2)O(n2). Berikut beberapa strategi umum dalam memilih pivot:<\/span><\/p>\n

      \n
    1. Pivot Terakhir<\/b>: Elemen terakhir dari array (seperti dalam implementasi di atas).<\/span><\/li>\n
    2. Pivot Pertama<\/b>: Elemen pertama dari array.<\/span><\/li>\n
    3. Pivot Tengah<\/b>: Elemen tengah dari array.<\/span><\/li>\n
    4. Pivot Acak<\/b>: Memilih elemen acak sebagai pivot, yang umumnya mengurangi kemungkinan terburuk O(n2)O(n^2)O(n2) dengan probabilitas tinggi.<\/span><\/li>\n<\/ol>\n

      Untuk meningkatkan performa dalam skenario terburuk, banyak implementasi <\/span>Quick Sort<\/span><\/i> modern menggunakan teknik pemilihan pivot acak atau strategi <\/span>median-of-three<\/span><\/i> yang memilih pivot dari median tiga elemen (elemen pertama, tengah, dan terakhir).<\/span><\/p>\n

      Berikut implementasi <\/span>Quick Sort<\/span><\/i> dengan pemilihan pivot acak:<\/span><\/p>\n

      import random<\/span><\/p>\n

       <\/p>\n

      def partition(arr, low, high):<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0# Memilih pivot acak<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0pivot_index = random.randint(low, high)<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0arr[pivot_index], arr[high] = arr[high], arr[pivot_index]\u00a0 # Tukar pivot dengan elemen terakhir<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0pivot = arr[high]<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0i = low – 1<\/span><\/p>\n

       <\/p>\n

      \u00a0\u00a0\u00a0\u00a0for j in range(low, high):<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0if arr[j] <= pivot:<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0i += 1<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0arr[i], arr[j] = arr[j], arr[i]<\/span><\/p>\n

       <\/p>\n

      \u00a0\u00a0\u00a0\u00a0arr[i + 1], arr[high] = arr[high], arr[i + 1]<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0return i + 1<\/span><\/p>\n

       <\/p>\n

      def quicksort(arr, low, high):<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0if low < high:<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0pi = partition(arr, low, high)<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0quicksort(arr, low, pi – 1)<\/span><\/p>\n

      \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0quicksort(arr, pi + 1, high)<\/span><\/p>\n

       <\/p>\n

      arr = [10, 7, 8, 9, 1, 5]<\/span><\/p>\n

      n = len(arr)<\/span><\/p>\n

      quicksort(arr, 0, n – 1)<\/span><\/p>\n

      print(f”Hasil pengurutan dengan pivot acak: {arr}”)<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

      By: Michael Wijaya Apa itu Algoritma Quick Sort? Algoritma Sorting merupakan algoritma yang menempatkan elemen list pada urutan tertentu. Urutan yang paling sering digunakan ialah urutan numerikal dan urutan lexicographical (Dalam matematika, urutan leksikografik, biasa dikenal sebagai urutan leksikal atau urutan alfabet, adalah bentuk umum dari urutan alfabet kata yang berdasarkan pada pengurutan huruf depan). […]<\/p>\n","protected":false},"author":2,"featured_media":13356,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[92,46],"tags":[],"class_list":["post-5083","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-article","category-news"],"yoast_head":"\nAlgoritma Quick Sort di Python | BINUS UNIVERSITY BANDUNG - Kampus Teknologi Kreatif<\/title>\n<meta name=\"description\" content=\"Algoritma Sorting merupakan algoritma yang menempatkan elemen list pada urutan tertentu. Urutan yang paling sering digunakan ialah urutan numerikal dan urutan lexicographical.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Algoritma Quick Sort di Python | BINUS UNIVERSITY BANDUNG - Kampus Teknologi Kreatif\" \/>\n<meta property=\"og:description\" content=\"Algoritma Sorting merupakan algoritma yang menempatkan elemen list pada urutan tertentu. Urutan yang paling sering digunakan ialah urutan numerikal dan urutan lexicographical.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/\" \/>\n<meta property=\"og:site_name\" content=\"BINUS UNIVERSITY BANDUNG - Kampus Teknologi Kreatif\" \/>\n<meta property=\"article:published_time\" content=\"2019-12-04T08:33:46+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-10-15T04:31:54+00:00\" \/>\n<meta property=\"og:image\" content=\"http:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2019\/12\/impmenet.png\" \/>\n\t<meta property=\"og:image:width\" content=\"703\" \/>\n\t<meta property=\"og:image:height\" content=\"364\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"cmcbinus\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"cmcbinus\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"4 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/\"},\"author\":{\"name\":\"cmcbinus\",\"@id\":\"https:\/\/binus.ac.id\/bandung\/#\/schema\/person\/f3d91be938f8fd4c72e0531c11adf26c\"},\"headline\":\"Algoritma Quick Sort di Python\",\"datePublished\":\"2019-12-04T08:33:46+00:00\",\"dateModified\":\"2024-10-15T04:31:54+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/\"},\"wordCount\":700,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/binus.ac.id\/bandung\/#organization\"},\"image\":{\"@id\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2019\/12\/impmenet.png\",\"articleSection\":[\"Article\",\"News\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/\",\"url\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/\",\"name\":\"Algoritma Quick Sort di Python | BINUS UNIVERSITY BANDUNG - Kampus Teknologi Kreatif\",\"isPartOf\":{\"@id\":\"https:\/\/binus.ac.id\/bandung\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2019\/12\/impmenet.png\",\"datePublished\":\"2019-12-04T08:33:46+00:00\",\"dateModified\":\"2024-10-15T04:31:54+00:00\",\"description\":\"Algoritma Sorting merupakan algoritma yang menempatkan elemen list pada urutan tertentu. Urutan yang paling sering digunakan ialah urutan numerikal dan urutan lexicographical.\",\"breadcrumb\":{\"@id\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#primaryimage\",\"url\":\"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2019\/12\/impmenet.png\",\"contentUrl\":\"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2019\/12\/impmenet.png\",\"width\":703,\"height\":364},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/binus.ac.id\/bandung\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Algoritma Quick Sort di Python\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/binus.ac.id\/bandung\/#website\",\"url\":\"https:\/\/binus.ac.id\/bandung\/\",\"name\":\"BINUS UNIVERSITY BANDUNG - Kampus Teknologi Kreatif\",\"description\":\"Binus kampus komunitas kreatif Bandung dengan visi membangun universitas yang berkelas dunia di tahun 2020 mendatang, sebagai langkah menuju visi tersebut, BINA NUSANTARA kampus komunitas kreatif mengambil suatu langkah mantap untuk membuka jaringan pendidikan di Kota Bandung.\",\"publisher\":{\"@id\":\"https:\/\/binus.ac.id\/bandung\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/binus.ac.id\/bandung\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/binus.ac.id\/bandung\/#organization\",\"name\":\"BINUS UNIVERSITY\",\"url\":\"https:\/\/binus.ac.id\/bandung\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/binus.ac.id\/bandung\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2017\/11\/site-logo.png\",\"contentUrl\":\"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2017\/11\/site-logo.png\",\"width\":140,\"height\":84,\"caption\":\"BINUS UNIVERSITY\"},\"image\":{\"@id\":\"https:\/\/binus.ac.id\/bandung\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/binus.ac.id\/bandung\/#\/schema\/person\/f3d91be938f8fd4c72e0531c11adf26c\",\"name\":\"cmcbinus\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/binus.ac.id\/bandung\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/d55450a51e075980932005cd0987c4324255b634bc10f6ee56068b92bba05b81?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/d55450a51e075980932005cd0987c4324255b634bc10f6ee56068b92bba05b81?s=96&d=mm&r=g\",\"caption\":\"cmcbinus\"},\"url\":\"https:\/\/binus.ac.id\/bandung\/author\/cmcbinus\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Algoritma Quick Sort di Python | BINUS UNIVERSITY BANDUNG - Kampus Teknologi Kreatif","description":"Algoritma Sorting merupakan algoritma yang menempatkan elemen list pada urutan tertentu. Urutan yang paling sering digunakan ialah urutan numerikal dan urutan lexicographical.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/","og_locale":"en_US","og_type":"article","og_title":"Algoritma Quick Sort di Python | BINUS UNIVERSITY BANDUNG - Kampus Teknologi Kreatif","og_description":"Algoritma Sorting merupakan algoritma yang menempatkan elemen list pada urutan tertentu. Urutan yang paling sering digunakan ialah urutan numerikal dan urutan lexicographical.","og_url":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/","og_site_name":"BINUS UNIVERSITY BANDUNG - Kampus Teknologi Kreatif","article_published_time":"2019-12-04T08:33:46+00:00","article_modified_time":"2024-10-15T04:31:54+00:00","og_image":[{"width":703,"height":364,"url":"http:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2019\/12\/impmenet.png","type":"image\/png"}],"author":"cmcbinus","twitter_card":"summary_large_image","twitter_misc":{"Written by":"cmcbinus","Est. reading time":"4 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#article","isPartOf":{"@id":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/"},"author":{"name":"cmcbinus","@id":"https:\/\/binus.ac.id\/bandung\/#\/schema\/person\/f3d91be938f8fd4c72e0531c11adf26c"},"headline":"Algoritma Quick Sort di Python","datePublished":"2019-12-04T08:33:46+00:00","dateModified":"2024-10-15T04:31:54+00:00","mainEntityOfPage":{"@id":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/"},"wordCount":700,"commentCount":0,"publisher":{"@id":"https:\/\/binus.ac.id\/bandung\/#organization"},"image":{"@id":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#primaryimage"},"thumbnailUrl":"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2019\/12\/impmenet.png","articleSection":["Article","News"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/","url":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/","name":"Algoritma Quick Sort di Python | BINUS UNIVERSITY BANDUNG - Kampus Teknologi Kreatif","isPartOf":{"@id":"https:\/\/binus.ac.id\/bandung\/#website"},"primaryImageOfPage":{"@id":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#primaryimage"},"image":{"@id":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#primaryimage"},"thumbnailUrl":"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2019\/12\/impmenet.png","datePublished":"2019-12-04T08:33:46+00:00","dateModified":"2024-10-15T04:31:54+00:00","description":"Algoritma Sorting merupakan algoritma yang menempatkan elemen list pada urutan tertentu. Urutan yang paling sering digunakan ialah urutan numerikal dan urutan lexicographical.","breadcrumb":{"@id":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#primaryimage","url":"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2019\/12\/impmenet.png","contentUrl":"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2019\/12\/impmenet.png","width":703,"height":364},{"@type":"BreadcrumbList","@id":"https:\/\/binus.ac.id\/bandung\/2019\/12\/algoritma-quick-sort-di-python\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/binus.ac.id\/bandung\/"},{"@type":"ListItem","position":2,"name":"Algoritma Quick Sort di Python"}]},{"@type":"WebSite","@id":"https:\/\/binus.ac.id\/bandung\/#website","url":"https:\/\/binus.ac.id\/bandung\/","name":"BINUS UNIVERSITY BANDUNG - Kampus Teknologi Kreatif","description":"Binus kampus komunitas kreatif Bandung dengan visi membangun universitas yang berkelas dunia di tahun 2020 mendatang, sebagai langkah menuju visi tersebut, BINA NUSANTARA kampus komunitas kreatif mengambil suatu langkah mantap untuk membuka jaringan pendidikan di Kota Bandung.","publisher":{"@id":"https:\/\/binus.ac.id\/bandung\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/binus.ac.id\/bandung\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/binus.ac.id\/bandung\/#organization","name":"BINUS UNIVERSITY","url":"https:\/\/binus.ac.id\/bandung\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/binus.ac.id\/bandung\/#\/schema\/logo\/image\/","url":"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2017\/11\/site-logo.png","contentUrl":"https:\/\/binus.ac.id\/bandung\/wp-content\/uploads\/2017\/11\/site-logo.png","width":140,"height":84,"caption":"BINUS UNIVERSITY"},"image":{"@id":"https:\/\/binus.ac.id\/bandung\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/binus.ac.id\/bandung\/#\/schema\/person\/f3d91be938f8fd4c72e0531c11adf26c","name":"cmcbinus","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/binus.ac.id\/bandung\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/d55450a51e075980932005cd0987c4324255b634bc10f6ee56068b92bba05b81?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/d55450a51e075980932005cd0987c4324255b634bc10f6ee56068b92bba05b81?s=96&d=mm&r=g","caption":"cmcbinus"},"url":"https:\/\/binus.ac.id\/bandung\/author\/cmcbinus\/"}]}},"_links":{"self":[{"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/posts\/5083","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/comments?post=5083"}],"version-history":[{"count":3,"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/posts\/5083\/revisions"}],"predecessor-version":[{"id":13355,"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/posts\/5083\/revisions\/13355"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/media\/13356"}],"wp:attachment":[{"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/media?parent=5083"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/categories?post=5083"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/binus.ac.id\/bandung\/wp-json\/wp\/v2\/tags?post=5083"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}