{"id":51070,"date":"2021-09-14T00:39:40","date_gmt":"2021-09-14T00:39:40","guid":{"rendered":"https:\/\/papersspot.com\/blog\/2021\/09\/14\/arm-assembly-find_max_index-and-sort\/"},"modified":"2021-09-14T00:39:40","modified_gmt":"2021-09-14T00:39:40","slug":"arm-assembly-find_max_index-and-sort","status":"publish","type":"post","link":"https:\/\/papersspot.com\/blog\/2021\/09\/14\/arm-assembly-find_max_index-and-sort\/","title":{"rendered":"ARM Assembly find_max_index and sort"},"content":{"rendered":"<p>c&#8221; <br \/>find_max_index- (name file &#8220;find_max_index _s.s&#8221;) <br \/>Given an array of integers, return the index of the largest integer in the array <br \/>$ .\/find_max_index 5 4 3 2 1C: 0Asm: 0 <br \/>$.\/find_max_index 1 2 3 4 5 <br \/>C: 4 <br \/>Asm: 4 <br \/>sort- name file &#8220;sort _s.s&#8221; <br \/>Given the address of an array of unsigned integers, and the length of the array, sort the input array descending (largest to smallest) in place given the C implementation of the sorting algorithm. MUST USE FIND_MAX_INDEX in sort implementation <br \/>$ .\/sort 10 30 20C: 30 20 10Asm: 30 20 10 <\/p>\n","protected":false},"excerpt":{"rendered":"<p>c&#8221; find_max_index- (name file &#8220;find_max_index _s.s&#8221;) Given an array of integers, return the index of the largest integer in the array $ .\/find_max_index 5 4 3 2 1C: 0Asm: 0 $.\/find_max_index 1 2 3 4 5 C: 4 Asm: 4 sort- name file &#8220;sort _s.s&#8221; Given the address of an array of unsigned integers, and [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[10],"class_list":["post-51070","post","type-post","status-publish","format-standard","hentry","category-research-paper-writing","tag-writing"],"_links":{"self":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/51070","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/comments?post=51070"}],"version-history":[{"count":0,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/51070\/revisions"}],"wp:attachment":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/media?parent=51070"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/categories?post=51070"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/tags?post=51070"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}