{"id":18286,"date":"2024-03-15T16:38:02","date_gmt":"2024-03-15T16:38:02","guid":{"rendered":"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/"},"modified":"2024-03-21T12:56:47","modified_gmt":"2024-03-21T12:56:47","slug":"how-to-write-a-code-for-the-quicksort-algorithm-in-java","status":"publish","type":"post","link":"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/","title":{"rendered":"&#8220;How to write a code for the quicksort algorithm in Java?&#8221;"},"content":{"rendered":"<p>Here is a Java code implementing the quicksort algorithm.<\/p>\n<pre class=\"post-pre\"><code><span class=\"hljs-keyword\">public<\/span> <span class=\"hljs-keyword\">class<\/span> <span class=\"hljs-title class_\">QuickSort<\/span> {\r\n    <span class=\"hljs-keyword\">public<\/span> <span class=\"hljs-keyword\">static<\/span> <span class=\"hljs-keyword\">void<\/span> <span class=\"hljs-title function_\">main<\/span><span class=\"hljs-params\">(String[] args)<\/span> {\r\n        <span class=\"hljs-type\">int<\/span>[] nums = {<span class=\"hljs-number\">5<\/span>, <span class=\"hljs-number\">2<\/span>, <span class=\"hljs-number\">8<\/span>, <span class=\"hljs-number\">9<\/span>, <span class=\"hljs-number\">1<\/span>, <span class=\"hljs-number\">3<\/span>, <span class=\"hljs-number\">7<\/span>};\r\n        quickSort(nums, <span class=\"hljs-number\">0<\/span>, nums.length - <span class=\"hljs-number\">1<\/span>);\r\n        <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-type\">int<\/span> num : nums) {\r\n            System.out.print(num + <span class=\"hljs-string\">\" \"<\/span>);\r\n        }\r\n    }\r\n\r\n    <span class=\"hljs-keyword\">public<\/span> <span class=\"hljs-keyword\">static<\/span> <span class=\"hljs-keyword\">void<\/span> <span class=\"hljs-title function_\">quickSort<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span>[] nums, <span class=\"hljs-type\">int<\/span> left, <span class=\"hljs-type\">int<\/span> right)<\/span> {\r\n        <span class=\"hljs-keyword\">if<\/span> (left &lt; right) {\r\n            <span class=\"hljs-type\">int<\/span> <span class=\"hljs-variable\">pivotIndex<\/span> <span class=\"hljs-operator\">=<\/span> partition(nums, left, right);\r\n            quickSort(nums, left, pivotIndex - <span class=\"hljs-number\">1<\/span>);\r\n            quickSort(nums, pivotIndex + <span class=\"hljs-number\">1<\/span>, right);\r\n        }\r\n    }\r\n\r\n    <span class=\"hljs-keyword\">public<\/span> <span class=\"hljs-keyword\">static<\/span> <span class=\"hljs-type\">int<\/span> <span class=\"hljs-title function_\">partition<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span>[] nums, <span class=\"hljs-type\">int<\/span> left, <span class=\"hljs-type\">int<\/span> right)<\/span> {\r\n        <span class=\"hljs-type\">int<\/span> <span class=\"hljs-variable\">pivot<\/span> <span class=\"hljs-operator\">=<\/span> nums[right];\r\n        <span class=\"hljs-type\">int<\/span> <span class=\"hljs-variable\">i<\/span> <span class=\"hljs-operator\">=<\/span> left - <span class=\"hljs-number\">1<\/span>;\r\n        <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-type\">int<\/span> <span class=\"hljs-variable\">j<\/span> <span class=\"hljs-operator\">=<\/span> left; j &lt; right; j++) {\r\n            <span class=\"hljs-keyword\">if<\/span> (nums[j] &lt;= pivot) {\r\n                i++;\r\n                swap(nums, i, j);\r\n            }\r\n        }\r\n        swap(nums, i + <span class=\"hljs-number\">1<\/span>, right);\r\n        <span class=\"hljs-keyword\">return<\/span> i + <span class=\"hljs-number\">1<\/span>;\r\n    }\r\n\r\n    <span class=\"hljs-keyword\">public<\/span> <span class=\"hljs-keyword\">static<\/span> <span class=\"hljs-keyword\">void<\/span> <span class=\"hljs-title function_\">swap<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span>[] nums, <span class=\"hljs-type\">int<\/span> i, <span class=\"hljs-type\">int<\/span> j)<\/span> {\r\n        <span class=\"hljs-type\">int<\/span> <span class=\"hljs-variable\">temp<\/span> <span class=\"hljs-operator\">=<\/span> nums[i];\r\n        nums[i] = nums[j];\r\n        nums[j] = temp;\r\n    }\r\n}\r\n<\/code><\/pre>\n<p>This code implements the quick sort algorithm. In the main function, a target array nums is defined and the quickSort function is called to sort it. The quickSort function uses recursion to perform quick sort, utilizing the partition function to determine the position of the pivot element and divide the array into two subarrays. The partition function selects the rightmost element as the pivot element, then traverses the array, swapping elements less than or equal to the pivot element to the left. Finally, the pivot element is swapped with the last element of the left subarray, and the position of the pivot element is returned. The swap function is used to swap the positions of two elements in the array. Once sorting is complete, the sorted array is outputted.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Here is a Java code implementing the quicksort algorithm. public class QuickSort { public static void main(String[] args) { int[] nums = {5, 2, 8, 9, 1, 3, 7}; quickSort(nums, 0, nums.length &#8211; 1); for (int num : nums) { System.out.print(num + &#8221; &#8220;); } } public static void quickSort(int[] nums, int left, int right) [&hellip;]<\/p>\n","protected":false},"author":10,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_import_markdown_pro_load_document_selector":0,"_import_markdown_pro_submit_text_textarea":"","footnotes":""},"categories":[1],"tags":[],"class_list":["post-18286","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v21.5 (Yoast SEO v21.5) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>&quot;How to write a code for the quicksort algorithm in Java?&quot; - Blog - Silicon Cloud<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"&quot;How to write a code for the quicksort algorithm in Java?&quot;\" \/>\n<meta property=\"og:description\" content=\"Here is a Java code implementing the quicksort algorithm. public class QuickSort { public static void main(String[] args) { int[] nums = {5, 2, 8, 9, 1, 3, 7}; quickSort(nums, 0, nums.length - 1); for (int num : nums) { System.out.print(num + &quot; &quot;); } } public static void quickSort(int[] nums, int left, int right) [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/\" \/>\n<meta property=\"og:site_name\" content=\"Blog - Silicon Cloud\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/SiliCloudGlobal\/\" \/>\n<meta property=\"article:published_time\" content=\"2024-03-15T16:38:02+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-03-21T12:56:47+00:00\" \/>\n<meta name=\"author\" content=\"Jackson Davis\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@SiliCloudGlobal\" \/>\n<meta name=\"twitter:site\" content=\"@SiliCloudGlobal\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Jackson Davis\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/\"},\"author\":{\"name\":\"Jackson Davis\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/55a10b8b0457c35884c25677889ad350\"},\"headline\":\"&#8220;How to write a code for the quicksort algorithm in Java?&#8221;\",\"datePublished\":\"2024-03-15T16:38:02+00:00\",\"dateModified\":\"2024-03-21T12:56:47+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/\"},\"wordCount\":149,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\"},\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/\",\"url\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/\",\"name\":\"\\\"How to write a code for the quicksort algorithm in Java?\\\" - Blog - Silicon Cloud\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#website\"},\"datePublished\":\"2024-03-15T16:38:02+00:00\",\"dateModified\":\"2024-03-21T12:56:47+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.silicloud.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"&#8220;How to write a code for the quicksort algorithm in Java?&#8221;\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#website\",\"url\":\"https:\/\/www.silicloud.com\/blog\/\",\"name\":\"Silicon Cloud Blog\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\"},\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\",\"name\":\"Silicon Cloud Blog\",\"url\":\"https:\/\/www.silicloud.com\/blog\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png\",\"contentUrl\":\"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png\",\"width\":1024,\"height\":1024,\"caption\":\"Silicon Cloud Blog\"},\"image\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/SiliCloudGlobal\/\",\"https:\/\/twitter.com\/SiliCloudGlobal\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/55a10b8b0457c35884c25677889ad350\",\"name\":\"Jackson Davis\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/2fdb47d6df1226e92380d96973782572a97b0675d098bb914410dec348eb5d29?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/2fdb47d6df1226e92380d96973782572a97b0675d098bb914410dec348eb5d29?s=96&d=mm&r=g\",\"caption\":\"Jackson Davis\"},\"url\":\"https:\/\/www.silicloud.com\/blog\/author\/jacksondavis\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"\"How to write a code for the quicksort algorithm in Java?\" - Blog - Silicon Cloud","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:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/","og_locale":"en_US","og_type":"article","og_title":"\"How to write a code for the quicksort algorithm in Java?\"","og_description":"Here is a Java code implementing the quicksort algorithm. public class QuickSort { public static void main(String[] args) { int[] nums = {5, 2, 8, 9, 1, 3, 7}; quickSort(nums, 0, nums.length - 1); for (int num : nums) { System.out.print(num + \" \"); } } public static void quickSort(int[] nums, int left, int right) [&hellip;]","og_url":"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/","og_site_name":"Blog - Silicon Cloud","article_publisher":"https:\/\/www.facebook.com\/SiliCloudGlobal\/","article_published_time":"2024-03-15T16:38:02+00:00","article_modified_time":"2024-03-21T12:56:47+00:00","author":"Jackson Davis","twitter_card":"summary_large_image","twitter_creator":"@SiliCloudGlobal","twitter_site":"@SiliCloudGlobal","twitter_misc":{"Written by":"Jackson Davis","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/#article","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/"},"author":{"name":"Jackson Davis","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/55a10b8b0457c35884c25677889ad350"},"headline":"&#8220;How to write a code for the quicksort algorithm in Java?&#8221;","datePublished":"2024-03-15T16:38:02+00:00","dateModified":"2024-03-21T12:56:47+00:00","mainEntityOfPage":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/"},"wordCount":149,"commentCount":0,"publisher":{"@id":"https:\/\/www.silicloud.com\/blog\/#organization"},"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/","url":"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/","name":"\"How to write a code for the quicksort algorithm in Java?\" - Blog - Silicon Cloud","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/#website"},"datePublished":"2024-03-15T16:38:02+00:00","dateModified":"2024-03-21T12:56:47+00:00","breadcrumb":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-a-code-for-the-quicksort-algorithm-in-java\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.silicloud.com\/blog\/"},{"@type":"ListItem","position":2,"name":"&#8220;How to write a code for the quicksort algorithm in Java?&#8221;"}]},{"@type":"WebSite","@id":"https:\/\/www.silicloud.com\/blog\/#website","url":"https:\/\/www.silicloud.com\/blog\/","name":"Silicon Cloud Blog","description":"","publisher":{"@id":"https:\/\/www.silicloud.com\/blog\/#organization"},"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/www.silicloud.com\/blog\/#organization","name":"Silicon Cloud Blog","url":"https:\/\/www.silicloud.com\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png","contentUrl":"https:\/\/www.silicloud.com\/blog\/wp-content\/uploads\/2023\/11\/EN-SILICON-Full.png","width":1024,"height":1024,"caption":"Silicon Cloud Blog"},"image":{"@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/SiliCloudGlobal\/","https:\/\/twitter.com\/SiliCloudGlobal"]},{"@type":"Person","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/55a10b8b0457c35884c25677889ad350","name":"Jackson Davis","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/2fdb47d6df1226e92380d96973782572a97b0675d098bb914410dec348eb5d29?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/2fdb47d6df1226e92380d96973782572a97b0675d098bb914410dec348eb5d29?s=96&d=mm&r=g","caption":"Jackson Davis"},"url":"https:\/\/www.silicloud.com\/blog\/author\/jacksondavis\/"}]}},"_links":{"self":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/18286","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/users\/10"}],"replies":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/comments?post=18286"}],"version-history":[{"count":1,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/18286\/revisions"}],"predecessor-version":[{"id":51955,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/18286\/revisions\/51955"}],"wp:attachment":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/media?parent=18286"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/categories?post=18286"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/tags?post=18286"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}