{"id":265,"date":"2022-05-24T17:34:00","date_gmt":"2022-05-24T16:34:00","guid":{"rendered":"https:\/\/blogs.glowscotland.org.uk\/glowblogs\/phshighercomputingscience\/?page_id=265"},"modified":"2022-05-24T18:48:27","modified_gmt":"2022-05-24T17:48:27","slug":"standard-algorithms","status":"publish","type":"page","link":"https:\/\/blogs.glowscotland.org.uk\/glowblogs\/phshighercomputingscience\/standard-algorithms\/","title":{"rendered":"Finding Maximum and Minimum"},"content":{"rendered":"

Because of the regularity with which these processes occur in different problems, they are known as standard algorithms<\/strong>.\u00a0 Each of the following 5 algorithms covered on the next few pages would typically be implemented as a function<\/strong> or procedure<\/strong>.<\/p>\n

Input Validation (Nat 5 algorithm)<\/h2>\n

Input validation is used to ensure that the user enters only data that is acceptable i.e. in a suitable format and within the limits of the data required for processing.<\/p>\n

Example in Pseudocode<\/strong><\/p>\n

\"\"<\/p>\n

Example in Python<\/strong><\/p>\n

\"\"<\/p>\n

Finding Maximum and Finding Minimum<\/h2>\n

These algorithms are most typically used when processing a list of data items in an array<\/strong>, for example finding the highest and lowest temperatures in some weather data or the fastest finisher in a cycling event from timing chip data recorded.<\/p>\n

The algorithms are obviously very similar since they use the same process.<\/p>\n

Example in Pseudocode – Finding Maximum<\/strong><\/p>\n

\"\"<\/p>\n

It is generally more useful to return the position<\/em> of the maximum or minimum value rather than the value itself, especially when there is associated data like names and so on stored in parallel arrays<\/strong> or arrays of records<\/strong>.<\/p>\n

\"\"<\/p>\n

Example in Python Finding Maximum<\/strong><\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

Example in Pseudocode – Finding Minimum<\/strong><\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

Example in Python- Finding Minimum<\/strong><\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n","protected":false},"excerpt":{"rendered":"

Because of the regularity with which these processes occur in different problems, they are known as standard algorithms.\u00a0 Each of the following 5 algorithms covered on the next few pages would typically be implemented as a function or procedure. Input Validation (Nat 5 algorithm) Input validation is used to ensure that the user enters only […]<\/p>\n","protected":false},"author":79984,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-265","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/blogs.glowscotland.org.uk\/glowblogs\/phshighercomputingscience\/wp-json\/wp\/v2\/pages\/265","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.glowscotland.org.uk\/glowblogs\/phshighercomputingscience\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/blogs.glowscotland.org.uk\/glowblogs\/phshighercomputingscience\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.glowscotland.org.uk\/glowblogs\/phshighercomputingscience\/wp-json\/wp\/v2\/users\/79984"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.glowscotland.org.uk\/glowblogs\/phshighercomputingscience\/wp-json\/wp\/v2\/comments?post=265"}],"version-history":[{"count":10,"href":"https:\/\/blogs.glowscotland.org.uk\/glowblogs\/phshighercomputingscience\/wp-json\/wp\/v2\/pages\/265\/revisions"}],"predecessor-version":[{"id":293,"href":"https:\/\/blogs.glowscotland.org.uk\/glowblogs\/phshighercomputingscience\/wp-json\/wp\/v2\/pages\/265\/revisions\/293"}],"wp:attachment":[{"href":"https:\/\/blogs.glowscotland.org.uk\/glowblogs\/phshighercomputingscience\/wp-json\/wp\/v2\/media?parent=265"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}