{"id":26962,"date":"2024-03-16T07:38:49","date_gmt":"2024-03-16T07:38:49","guid":{"rendered":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/"},"modified":"2024-03-22T09:52:01","modified_gmt":"2024-03-22T09:52:01","slug":"how-to-write-code-for-quick-sort-in-c","status":"publish","type":"post","link":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/","title":{"rendered":"How to write code for Quick Sort in C++?"},"content":{"rendered":"<p>Below is an example code for the quick sort algorithm in C++.<\/p>\n<pre class=\"post-pre\"><code><span class=\"hljs-meta\">#<span class=\"hljs-keyword\">include<\/span> <span class=\"hljs-string\">&lt;iostream&gt;<\/span><\/span>\r\n<span class=\"hljs-keyword\">using<\/span> <span class=\"hljs-keyword\">namespace<\/span> std;\r\n\r\n<span class=\"hljs-comment\">\/\/ \u4ea4\u6362\u4e24\u4e2a\u5143\u7d20\u7684\u503c<\/span>\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">void<\/span> <span class=\"hljs-title\">swap<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span>* a, <span class=\"hljs-type\">int<\/span>* b)<\/span> <\/span>{\r\n    <span class=\"hljs-type\">int<\/span> temp = *a;\r\n    *a = *b;\r\n    *b = temp;\r\n}\r\n\r\n<span class=\"hljs-comment\">\/\/ \u5c06\u6570\u7ec4\u5212\u5206\u4e3a\u4e24\u4e2a\u5b50\u6570\u7ec4\uff0c\u5c0f\u4e8epivot\u7684\u653e\u5728\u5de6\u8fb9\uff0c\u5927\u4e8epivot\u7684\u653e\u5728\u53f3\u8fb9<\/span>\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">int<\/span> <span class=\"hljs-title\">partition<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span> arr[], <span class=\"hljs-type\">int<\/span> low, <span class=\"hljs-type\">int<\/span> high)<\/span> <\/span>{\r\n    <span class=\"hljs-type\">int<\/span> pivot = arr[high];  <span class=\"hljs-comment\">\/\/ \u9009\u62e9\u6700\u53f3\u8fb9\u7684\u5143\u7d20\u4f5c\u4e3apivot<\/span>\r\n    <span class=\"hljs-type\">int<\/span> i = low - <span class=\"hljs-number\">1<\/span>;\r\n\r\n    <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-type\">int<\/span> j = low; j &lt;= high - <span class=\"hljs-number\">1<\/span>; j++) {\r\n        <span class=\"hljs-keyword\">if<\/span> (arr[j] &lt; pivot) {\r\n            i++;\r\n            <span class=\"hljs-built_in\">swap<\/span>(&amp;arr[i], &amp;arr[j]);\r\n        }\r\n    }\r\n    <span class=\"hljs-built_in\">swap<\/span>(&amp;arr[i + <span class=\"hljs-number\">1<\/span>], &amp;arr[high]);\r\n    <span class=\"hljs-keyword\">return<\/span> i + <span class=\"hljs-number\">1<\/span>;\r\n}\r\n\r\n<span class=\"hljs-comment\">\/\/ \u5feb\u901f\u6392\u5e8f\u51fd\u6570<\/span>\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">void<\/span> <span class=\"hljs-title\">quickSort<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span> arr[], <span class=\"hljs-type\">int<\/span> low, <span class=\"hljs-type\">int<\/span> high)<\/span> <\/span>{\r\n    <span class=\"hljs-keyword\">if<\/span> (low &lt; high) {\r\n        <span class=\"hljs-type\">int<\/span> pivotIndex = <span class=\"hljs-built_in\">partition<\/span>(arr, low, high);  <span class=\"hljs-comment\">\/\/ \u5212\u5206\u6570\u7ec4<\/span>\r\n        <span class=\"hljs-built_in\">quickSort<\/span>(arr, low, pivotIndex - <span class=\"hljs-number\">1<\/span>);  <span class=\"hljs-comment\">\/\/ \u5bf9\u5de6\u5b50\u6570\u7ec4\u8fdb\u884c\u5feb\u901f\u6392\u5e8f<\/span>\r\n        <span class=\"hljs-built_in\">quickSort<\/span>(arr, pivotIndex + <span class=\"hljs-number\">1<\/span>, high);  <span class=\"hljs-comment\">\/\/ \u5bf9\u53f3\u5b50\u6570\u7ec4\u8fdb\u884c\u5feb\u901f\u6392\u5e8f<\/span>\r\n    }\r\n}\r\n\r\n<span class=\"hljs-comment\">\/\/ \u6253\u5370\u6570\u7ec4<\/span>\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">void<\/span> <span class=\"hljs-title\">printArray<\/span><span class=\"hljs-params\">(<span class=\"hljs-type\">int<\/span> arr[], <span class=\"hljs-type\">int<\/span> size)<\/span> <\/span>{\r\n    <span class=\"hljs-keyword\">for<\/span> (<span class=\"hljs-type\">int<\/span> i = <span class=\"hljs-number\">0<\/span>; i &lt; size; i++) {\r\n        cout &lt;&lt; arr[i] &lt;&lt; <span class=\"hljs-string\">\" \"<\/span>;\r\n    }\r\n    cout &lt;&lt; endl;\r\n}\r\n\r\n<span class=\"hljs-function\"><span class=\"hljs-type\">int<\/span> <span class=\"hljs-title\">main<\/span><span class=\"hljs-params\">()<\/span> <\/span>{\r\n    <span class=\"hljs-type\">int<\/span> arr[] = { <span class=\"hljs-number\">8<\/span>, <span class=\"hljs-number\">3<\/span>, <span class=\"hljs-number\">6<\/span>, <span class=\"hljs-number\">2<\/span>, <span class=\"hljs-number\">1<\/span>, <span class=\"hljs-number\">5<\/span>, <span class=\"hljs-number\">7<\/span>, <span class=\"hljs-number\">4<\/span> };\r\n    <span class=\"hljs-type\">int<\/span> size = <span class=\"hljs-built_in\">sizeof<\/span>(arr) \/ <span class=\"hljs-built_in\">sizeof<\/span>(arr[<span class=\"hljs-number\">0<\/span>]);\r\n\r\n    cout &lt;&lt; <span class=\"hljs-string\">\"\u539f\u6570\u7ec4\uff1a\"<\/span>;\r\n    <span class=\"hljs-built_in\">printArray<\/span>(arr, size);\r\n\r\n    <span class=\"hljs-built_in\">quickSort<\/span>(arr, <span class=\"hljs-number\">0<\/span>, size - <span class=\"hljs-number\">1<\/span>);\r\n\r\n    cout &lt;&lt; <span class=\"hljs-string\">\"\u6392\u5e8f\u540e\uff1a\"<\/span>;\r\n    <span class=\"hljs-built_in\">printArray<\/span>(arr, size);\r\n\r\n    <span class=\"hljs-keyword\">return<\/span> <span class=\"hljs-number\">0<\/span>;\r\n}\r\n<\/code><\/pre>\n<p>First, this code defines a function called swap for swapping two elements, then it defines a function called partition for dividing the array into two subarrays, and finally defines a quicksort function called quickSort. The quickSort function recursively sorts the left and right subarrays, while the partition function divides the array based on a selected pivot.<\/p>\n<p>In the main function, an array arr is first defined for sorting, then the quickSort function is called for sorting, and finally the printArray function is called to print the sorted array.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Below is an example code for the quick sort algorithm in C++. #include &lt;iostream&gt; using namespace std; \/\/ \u4ea4\u6362\u4e24\u4e2a\u5143\u7d20\u7684\u503c void swap(int* a, int* b) { int temp = *a; *a = *b; *b = temp; } \/\/ \u5c06\u6570\u7ec4\u5212\u5206\u4e3a\u4e24\u4e2a\u5b50\u6570\u7ec4\uff0c\u5c0f\u4e8epivot\u7684\u653e\u5728\u5de6\u8fb9\uff0c\u5927\u4e8epivot\u7684\u653e\u5728\u53f3\u8fb9 int partition(int arr[], int low, int high) { int pivot = arr[high]; \/\/ \u9009\u62e9\u6700\u53f3\u8fb9\u7684\u5143\u7d20\u4f5c\u4e3apivot int i = [&hellip;]<\/p>\n","protected":false},"author":6,"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-26962","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>How to write code for Quick Sort in C++? - 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-code-for-quick-sort-in-c\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"How to write code for Quick Sort in C++?\" \/>\n<meta property=\"og:description\" content=\"Below is an example code for the quick sort algorithm in C++. #include &lt;iostream&gt; using namespace std; \/\/ \u4ea4\u6362\u4e24\u4e2a\u5143\u7d20\u7684\u503c void swap(int* a, int* b) { int temp = *a; *a = *b; *b = temp; } \/\/ \u5c06\u6570\u7ec4\u5212\u5206\u4e3a\u4e24\u4e2a\u5b50\u6570\u7ec4\uff0c\u5c0f\u4e8epivot\u7684\u653e\u5728\u5de6\u8fb9\uff0c\u5927\u4e8epivot\u7684\u653e\u5728\u53f3\u8fb9 int partition(int arr[], int low, int high) { int pivot = arr[high]; \/\/ \u9009\u62e9\u6700\u53f3\u8fb9\u7684\u5143\u7d20\u4f5c\u4e3apivot int i = [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/\" \/>\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-16T07:38:49+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-03-22T09:52:01+00:00\" \/>\n<meta name=\"author\" content=\"Benjamin Taylor\" \/>\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=\"Benjamin Taylor\" \/>\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-code-for-quick-sort-in-c\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/\"},\"author\":{\"name\":\"Benjamin Taylor\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/ac801fe9549a25960ce48aa2e0a691c9\"},\"headline\":\"How to write code for Quick Sort in C++?\",\"datePublished\":\"2024-03-16T07:38:49+00:00\",\"dateModified\":\"2024-03-22T09:52:01+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/\"},\"wordCount\":109,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#organization\"},\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/\",\"url\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/\",\"name\":\"How to write code for Quick Sort in C++? - Blog - Silicon Cloud\",\"isPartOf\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/#website\"},\"datePublished\":\"2024-03-16T07:38:49+00:00\",\"dateModified\":\"2024-03-22T09:52:01+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.silicloud.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"How to write code for Quick Sort in C++?\"}]},{\"@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\/ac801fe9549a25960ce48aa2e0a691c9\",\"name\":\"Benjamin Taylor\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/ec2e3d3e2d525fd148047c4520ae7c1cdccd1f4b48a1a488422b31f04f345c14?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/ec2e3d3e2d525fd148047c4520ae7c1cdccd1f4b48a1a488422b31f04f345c14?s=96&d=mm&r=g\",\"caption\":\"Benjamin Taylor\"},\"url\":\"https:\/\/www.silicloud.com\/blog\/author\/benjamintaylor\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"How to write code for Quick Sort in C++? - 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-code-for-quick-sort-in-c\/","og_locale":"en_US","og_type":"article","og_title":"How to write code for Quick Sort in C++?","og_description":"Below is an example code for the quick sort algorithm in C++. #include &lt;iostream&gt; using namespace std; \/\/ \u4ea4\u6362\u4e24\u4e2a\u5143\u7d20\u7684\u503c void swap(int* a, int* b) { int temp = *a; *a = *b; *b = temp; } \/\/ \u5c06\u6570\u7ec4\u5212\u5206\u4e3a\u4e24\u4e2a\u5b50\u6570\u7ec4\uff0c\u5c0f\u4e8epivot\u7684\u653e\u5728\u5de6\u8fb9\uff0c\u5927\u4e8epivot\u7684\u653e\u5728\u53f3\u8fb9 int partition(int arr[], int low, int high) { int pivot = arr[high]; \/\/ \u9009\u62e9\u6700\u53f3\u8fb9\u7684\u5143\u7d20\u4f5c\u4e3apivot int i = [&hellip;]","og_url":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/","og_site_name":"Blog - Silicon Cloud","article_publisher":"https:\/\/www.facebook.com\/SiliCloudGlobal\/","article_published_time":"2024-03-16T07:38:49+00:00","article_modified_time":"2024-03-22T09:52:01+00:00","author":"Benjamin Taylor","twitter_card":"summary_large_image","twitter_creator":"@SiliCloudGlobal","twitter_site":"@SiliCloudGlobal","twitter_misc":{"Written by":"Benjamin Taylor","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/#article","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/"},"author":{"name":"Benjamin Taylor","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/ac801fe9549a25960ce48aa2e0a691c9"},"headline":"How to write code for Quick Sort in C++?","datePublished":"2024-03-16T07:38:49+00:00","dateModified":"2024-03-22T09:52:01+00:00","mainEntityOfPage":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/"},"wordCount":109,"commentCount":0,"publisher":{"@id":"https:\/\/www.silicloud.com\/blog\/#organization"},"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/","url":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/","name":"How to write code for Quick Sort in C++? - Blog - Silicon Cloud","isPartOf":{"@id":"https:\/\/www.silicloud.com\/blog\/#website"},"datePublished":"2024-03-16T07:38:49+00:00","dateModified":"2024-03-22T09:52:01+00:00","breadcrumb":{"@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.silicloud.com\/blog\/how-to-write-code-for-quick-sort-in-c\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.silicloud.com\/blog\/"},{"@type":"ListItem","position":2,"name":"How to write code for Quick Sort in C++?"}]},{"@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\/ac801fe9549a25960ce48aa2e0a691c9","name":"Benjamin Taylor","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.silicloud.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/ec2e3d3e2d525fd148047c4520ae7c1cdccd1f4b48a1a488422b31f04f345c14?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/ec2e3d3e2d525fd148047c4520ae7c1cdccd1f4b48a1a488422b31f04f345c14?s=96&d=mm&r=g","caption":"Benjamin Taylor"},"url":"https:\/\/www.silicloud.com\/blog\/author\/benjamintaylor\/"}]}},"_links":{"self":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/26962","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\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/comments?post=26962"}],"version-history":[{"count":1,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/26962\/revisions"}],"predecessor-version":[{"id":61162,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/posts\/26962\/revisions\/61162"}],"wp:attachment":[{"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/media?parent=26962"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/categories?post=26962"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.silicloud.com\/blog\/wp-json\/wp\/v2\/tags?post=26962"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}