Questions about code that is working but you are seeking to improve can be asked at codereview.stackexchange.com — Paulw11 52 secs ago
I am learning data structures and below is my implementation of a stack in JavaScript. I didn't want to use built in functions for an array because in JavaScript that would be too easy, so I made my own.
class Stack {
constructor(data=null) {
this.items = [data]
this.length = 0
}
...
0
I am a new F# programmer, and a student in a security class. As part of my notes, I wrote a small implementation of a monoalphabetic cipher as follows:
open System
let random = Random()
let defaultCharMap() =
['a' .. 'z'] @ ['A' .. 'Z'] @ ['0' .. '9']
let randomCharMap() =
let map = defa...0
I've been experimenting with the F# Bolero environment to learn F# a bit and I was trying to get the hang of pattern matching by generating ordinal numbers (1st, 2nd, 3rd, ...) from cardinal numbers (1, 2, 3, ...).
Here's the code I came up with:
let ordinal n =
if n > 20 then
match n...-1
0
0
0
As this is a very basic word wrap program, it has at least the following 3 limitations :-
The file should have a terminating newline.
The column number at which the lines are to be wrapped must be greater than or equal to the length of the longest word.
Tabs (\t) should not have been used in the...
1
0
0
0
0
0
0
