[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_129":130,"_131":132},"routes/public/layout",{"_68":69},"routes/public/primary/notes",{"_11":12,"_13":14},"note",{"_17":42,"_19":42,"_20":58,"_22":59,"_24":60,"_26":61,"_28":62,"_30":63,"_32":63,"_33":64,"_35":65,"_37":66,"_13":67},"backlinks",[15,16],{"_17":40,"_19":40,"_20":46,"_22":47,"_24":48,"_26":27,"_28":49,"_30":50,"_32":50,"_33":51,"_35":52,"_37":53,"_13":54},{"_17":18,"_19":18,"_20":21,"_22":23,"_24":25,"_26":27,"_28":29,"_30":31,"_32":31,"_33":34,"_35":36,"_37":38,"_13":39},"id","computer-science/algorithm/practical-knowledges/insertion-sort/sorting-problem","slug","title","Sorting Problem","path","Computer Science/Algorithm/Practical Knowledges/Insertion Sort/Sorting Problem","canonicalPath","/notes/computer-science/algorithm/practical-knowledges/insertion-sort/sorting-problem","folder","Computer Science","tags",[],"createdAt","2026-07-26T03:12:21.700Z","modifiedAt","excerpt","Salah satu bentuk dari [[Computational Problem]] yang perlu dipecahkan dengan algoritma. Tujuannya adalah untuk menghasilkan [[Permutasi]] dari input yang diberikan. Istilah lain dari input (umumnya deret angka) tersebut","html","

Salah satu bentuk dari Computational Problem yang perlu dipecahkan dengan algoritma. Tujuannya adalah untuk menghasilkan Permutasi dari input yang diberikan.

Istilah lain dari input (umumnya deret angka) tersebut adalah Keys. Saat kita ingin mengurutkan suatu deret, biasanya karena Keys tersebut terkait dengan data lain yang disebut Satellite Data. Keys dan Satellite Data bersama-sama membentuk Record.

Ketika mengulas sebuah Sorting Problem, kita akan fokus ke Keys, tapi harus tetap diperhatikan bahwa umumnya akan ada Satellite Data terkait Keys tersebut.

","outgoing",[41,42,43,44,45],[40],"computer-science/algorithm/practical-knowledges/insertion-sort/insertion-sort","computer-science/algorithm/theoretical-knowledges/computational-problem","general/terms/permutasi","computer-science/algorithm/practical-knowledges/insertion-sort/keys","computer-science/algorithm/practical-knowledges/insertion-sort/satellite-data","computer-science/algorithm/practical-knowledges/insertion-sort/record","Insertion Sort","Computer Science/Algorithm/Practical Knowledges/Insertion Sort/Insertion Sort","/notes/computer-science/algorithm/practical-knowledges/insertion-sort/insertion-sort",[],"2026-07-26T03:12:21.697Z","Insertion sort adalah algoritma sorting (pengurutan) yang paling efisien untuk elemen dalam jumlah kecil. Cara kerjanya mirip seperti mengurutkan kartu dengan tangan kita. Bayangkan ada sebuah tumpukan kartu di meja, kem","

Insertion sort adalah algoritma sorting (pengurutan) yang paling efisien untuk elemen dalam jumlah kecil.

Cara kerjanya mirip seperti mengurutkan kartu dengan tangan kita. Bayangkan ada sebuah tumpukan kartu di meja, kemudian kita mengambil satu kartu untuk dipegang di tangan kiri, lalu kita mengambil kartu baru dengan tangan kanan kemudian menempatkannya di tangan kiri pada posisi yang tepat sesuai kartu yang telah ada.

Diketahui sebuah Sorting Problem sebagai berikut:

Input: Sebuah deretan angka sebanyak n
Output: Sebuah Permutasi dari deret angka input

Berikut solusinya dengan insertion sort dalam Pseudocode:

// Index pertama adalah 1\n\nInsertionSort(A, n)\n\tfor i = 2 to n\n\t\tkey = A[i]\n\t\tj = i - 1\n\t\n\t\t// Memasukkan A[i] ke subarray yang sudah \n\t\t// urut A[1: i - 1]\n\t\twhile j > 0 and A[j] > key\n\t\t\tA[j + 1] = A[j]\n\t\t\tj = j - 1\n\t\tA[j + 1] = key\n

Fungsi tersebut menerima dua input yaitu array berisi deret angka yang ingin diurutkan dengan parameter A dan panjang dari array tersebut dengan parameter n.

Index i adalah kartu yang saat ini sedang diproses. Pada awal perulangan, yang mana indexnya i, Subarray sebelah kiri yang berisi elemen A[1:i-1] mewakili tangan kiri yang memegang kartu yang sudah terurut. Subarray sebelah kanan yang berisi elemen A[i+1:n] mewakili tumpukan kartu yang masih ada di meja. Notasi A[1:i-1] disebut Loop Invariant.

Berikut jika ditulis dalam Typescript:

function insertionSort(numbers: number[]): void {\n  for (let i = 1; i < numbers.length; i++) {\n    const key = numbers[i];\n    let j = i - 1;\n\n    while (j >= 0 && numbers[j] > key) {\n      numbers[j + 1] = numbers[j];\n      j = j - 1;\n    }\n    numbers[j + 1] = key;\n  }\n\n  console.log(\"Sorted array:\", numbers);\n}\n

",[18,42,56,57],[55],"computer-science/algorithm/algorithm","computer-science/algorithm/practical-knowledges/insertion-sort/subarray","computer-science/algorithm/practical-knowledges/insertion-sort/loop-invariant","Permutasi","General/Terms/Permutasi","/notes/general/terms/permutasi","General",[],"2026-07-26T03:12:21.735Z","Permutasi adalah penyusunan elemen dari suatu himpunan dalam urutan tertentu, di mana urutan elemen yang dipilih sangat diperhatikan.","

Permutasi adalah penyusunan elemen dari suatu himpunan dalam urutan tertentu, di mana urutan elemen yang dipilih sangat diperhatikan.

",[],[40,18],"profile",{"_17":70,"_71":68,"_72":73,"_74":75,"_76":77,"_78":79,"_30":80,"_81":82},"6954a19b11e7fe6da253c845","type","identity",{"_119":120,"_121":122,"_123":124,"_125":126},"contact",{"_111":112,"_113":114},"seo",{"_20":95,"_96":97,"_98":99,"_100":101,"_102":103,"_104":105},"bio",{"_83":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94},"2025-12-31T04:07:55.862Z","updatedAt","2026-07-28T08:55:52.260Z","p1","Maulana Hafidz Ismail is an engineer who believes technology isn't just about efficiency. It's about resistance.","p2","While the world optimizes for profit, he builds to question the system itself: in education, work, and how we define value.","p3","His background blends engineering precision with entrepreneurial instinct. He has worked across software development, database systems, and AI, always driven by one goal: to make tools that actually serve people, not the hierarchy itself.","closing","This site is his lab. He writes journals to document a process, articles to share thought, and papers to formalize the things he learns.","tagline","Some ideas fail, some evolve, all of them teach.","callToAction","If you're building, rebelling, or just thinking about how to make things better, you're already part of the conversation.","Maulana Hafidz","description","Technical articles, engineering notes, system design explorations, and project documentation by Maulana Hafidz Ismail, an Engineer documenting real software systems.","shortDescription","Maulana Hafidz Ismail is an Engineer and Entrepreneur in training. Redefining fairness in education, work, and governance.","url","https://maulanahafidz.com","image","https://maulanahafidz.com/og-image.jpg","keywords",[106,107,108,109,110],"Meta Engineer","Entrepreneur","Software Engineer","AI Developer","System Designer","email","contact@maulanahafidz.com","socials",{"_115":116,"_117":118},"github","https://github.com/imhefizh/","linkedin","https://www.linkedin.com/in/maulana-hafidz-ismail/","fullName","Maulana Hafidz Ismail","shortName","ImHefizh","titles",[127,128],"subtitle","Building systems that question the system.","Software Engineering","Entrepreneurship","nonce","7d425e829f7448dea64941fb187bc861","language","EN"]

Linked mentions