{"id":6210,"date":"2021-08-21T01:22:29","date_gmt":"2021-08-20T19:52:29","guid":{"rendered":"https:\/\/golangbyexamples.com\/?p=6210"},"modified":"2021-08-21T01:23:08","modified_gmt":"2021-08-20T19:53:08","slug":"sort-part-slice-go","status":"publish","type":"post","link":"https:\/\/golangbyexamples.com\/sort-part-slice-go\/","title":{"rendered":"Sort a part of the slice in Go (Golang)"},"content":{"rendered":"\n
Overview<\/strong><\/p>\n\n\n\n sort.Slice<\/strong> package of golang can be used to sort a full slice or a part of the sliceFull slice sorting in asc order<\/p>\n\n\n\n Output<\/strong><\/p>\n\n\n\n Full slice sorting in desc order<\/p>\n\n\n\n Output<\/strong><\/p>\n\n\n\n Part slice sorting<\/p>\n\n\n\n Output<\/strong><\/p>\n\n\n\n Notice that it has sorted the last two elements in the asc order.<\/p>\n\n\n\n Note: <\/strong>Check out our Golang Advanced Tutorial. The tutorials in this series are elaborative and we have tried to cover all concepts with examples. This tutorial is for those who are looking to gain expertise and a solid understanding of golang - Golang Advance Tutorial<\/a><\/p>\n\n\n\n Also if you are interested in understanding how all design patterns can be implemented in Golang. If yes, then this post is for you -All Design Patterns Golang<\/a><\/p>\n","protected":false},"excerpt":{"rendered":" Overview sort.Slice package of golang can be used to sort a full slice or a part of the sliceFull slice sorting in asc order Output Full slice sorting in desc order Output…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"spay_email":"","footnotes":"","jetpack_publicize_message":"","jetpack_is_tweetstorm":false},"categories":[1],"tags":[3,4],"class_list":["post-6210","post","type-post","status-publish","format-standard","hentry","category-tech","tag-go","tag-golang"],"yoast_head":"\npackage main\n\nimport (\n\t\"fmt\"\n\t\"sort\"\n)\n\nfunc main() {\n\n\tnums := []int{3, 4, 2, 1}\n\tsort.Slice(nums, func(i, j int) bool {\n\t\treturn nums[i] < nums[j]\n\t})\n\tfmt.Println(nums)\n}<\/code><\/pre>\n\n\n\n
[1,2,3,4]<\/code><\/pre>\n\n\n\n
package main\nimport (\n \"fmt\"\n \"sort\"\n)\nfunc main() {\n nums := []int{3, 4, 2, 1}\n sort.Slice(nums, func(i, j int) bool {\n return nums[i] > nums[j]\n })\n fmt.Println(nums)\n}<\/code><\/pre>\n\n\n\n
[4 3 2 1]<\/code><\/pre>\n\n\n\n
package main\n\nimport (\n\t\"fmt\"\n\t\"sort\"\n)\n\nfunc main() {\n\n\tnums := []int{3, 4, 2, 1}\n\tstart := 2\n\tend := 4\n\tsort.Slice(nums[start:end], func(i, j int) bool {\n\t\treturn nums[start+i] < nums[start+j]\n\t})\n\tfmt.Println(nums)\n}<\/code><\/pre>\n\n\n\n
[3 4 1 2]<\/code><\/pre>\n\n\n\n