Horje Website
Sample Algorithmic Problem – Algorithms Code

An algorithmic problem is specified by describing the complete set of instances it must work on and of its output after running on one of these instances. This distinction, between a problem and an instance of a problem, is fundamental. The algorithmic problem known as sorting is defined as follows: [Skiena:2008:ADM:1410219]

 

Problem: Sorting

Input:

A sequence of keys, a_1, a_2, …, a_n.

Output:

The reordering of the input sequence such that a‘_1 <= a’_2 <= … <= a‘_{n-1} <= a’_n

An instance of sorting might be an array of strings, such as Haskell, Emacs } or a sequence of numbers such as

 

1542451337 }.

Published:
January 1, 2023
Author:
admin
Category:
Algorithms Course
Views:
27

This article was posted in Algorithms Course. Bookmark the permalink. Follow comments with the RSS feed for this post.Post a Comment or leave a trackback: Trackback URL.

Leave a Reply

Your email address will not be published. Required fields are marked *

 

Horje © 2011 - 2023