MCPcopy Create free account
hub / github.com/anupam-kumar-krishnan/Competitive_Programming / primeNum

Function primeNum

Basic Programming/pattern.c:3–9  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1#include <stdio.h>
2
3void primeNum(int n)
4{
5 for (int i = 1; i <= n; i++)
6 {
7 printf(" 8%d", i);
8 }
9}
10void primeNumReverse(int n)
11{
12 for (int i = n; i >= 1; i--)

Callers 1

mainFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected