Define the term counting - Pseudocode

Counting in 1s is quite simple; use of statement count = count + 1 would enable counting to be done (for example in controlling a repeat loop). Statement literally means: (new) count = the (old) count + 1

It's possible to count in any increments just by altering the numerical value in statement (for example count = count - 1 counts backwards)

 

Posted Date: 9/11/2013 3:46:25 AM | Location : United States

Ask an Expert

Related Discussions:- Define the term counting - pseudocode, Assignment Help, Ask Question on Define the term counting - pseudocode, Get Answer, Expert's Help, Define the term counting - pseudocode Discussions

Write discussion on Define the term counting - pseudocode
Your posts are moderated

Write your message here..

Related Questions

Illustrate an example of algorithm, Illustrate an example of algorithm ... Illustrate an example of algorithm Consider that an algorithm is a sequence of steps, not a program. You might use the same algorithm in different programs, or express same alg

Explain open addressing, Open addressing The easiest way to resolve a c... Open addressing The easiest way to resolve a collision is to start with the hash address and do a sequential search by the table for an empty location.

Recursion, i need help in java recursion assignment. i need help in java recursion assignment.

frequenty count of function, Ask question find frequency count of function... Ask question find frequency count of function- {for(i=1;i {for(j=1;j {for(k=1;k } } }

Array implementation of a queue, Since the stack is list of elements, the q... Since the stack is list of elements, the queue is also a list of elements. The stack & the queue differ just in the position where the elements may be added or deleted. Similar to

2 way merge sort, merge sort process for an example array {38, 27, 43, 3, 9... merge sort process for an example array {38, 27, 43, 3, 9, 82, 10}. If we take a closer look at the diagram, we can see that the array is recursively divided in two halves till the

Demonstrate that dijkstra''s algorithm, Demonstrate that Dijkstra's algorit... Demonstrate that Dijkstra's algorithm does not necessarily work if some of the costs are negative by finding a digraph with negative costs (but no negative cost dicircuits) for whi

LINKED LIST, HOW LINKED LIST HEADER WORKS? HOW TO INSERT AND DELETE ELEMENT... HOW LINKED LIST HEADER WORKS? HOW TO INSERT AND DELETE ELEMENTS IN LINKED LIST?

Heap sort, We will start by defining a new structure called Heap. Figure 3 ... We will start by defining a new structure called Heap. Figure 3 illustrates a Binary tree. Figure: A Binary Tree A complete binary tree is said to assure the 'heap con

Illustrate the intervals in mathematics, Illustrate the intervals in mathem... Illustrate the intervals in mathematics Carrier set of a Range of T is the set of all sets of values v ∈ T such that for some start value s ∈ T and end value e ∈ T, either s ≤