---
title: "Storing 3-Letter Words in an Array"
type: "article"
slug: "storing-3-letter-words-in-an-array"
url: "http://localhost/article/storing-3-letter-words-in-an-array/"
markdown_url: "http://localhost/article/storing-3-letter-words-in-an-array.md"
published_at: "2020-10-27T17:18:50+00:00"
modified_at: "2024-06-23T01:05:05+00:00"
featured_image:
  url: "http://localhost/wp-content/uploads/2022/04/20230809-041332.jpg"
excerpt: "I wanted to develop a method of storing as many three-letter words as possible in my 1K ZX80). using as little memory as possible. The solution is based on the fact that charaeter numbers of the letters can be compounded into a single number, which can be stored in an array element. Thus three letters…"
category:
  - name: "SYNC"
    slug: "sync"
    taxonomy: "category"
    url: "http://localhost/category/periodicals/sync/"
post_tag:
  - name: "1982"
    slug: "year-1982"
    taxonomy: "post_tag"
    url: "http://localhost/tag/year-1982/"
  - name: "Type-in program"
    slug: "type-in-program"
    taxonomy: "post_tag"
    url: "http://localhost/tag/type-in-program/"
  - name: "ZX80"
    slug: "zx80"
    taxonomy: "post_tag"
    url: "http://localhost/tag/zx80/"
model:
  - name: "Sinclair ZX80"
    slug: "zx80"
    taxonomy: "model"
    url: "http://localhost/model/zx80/"
indiv:
  - name: "F. W. Manders"
    slug: "f-w-manders"
    taxonomy: "indiv"
    url: "http://localhost/indiv/f-w-manders/"
publication: "Sync"
publication_r:
  id: 10243
  title: "SYNC"
  type: "periodical"
  url: "http://localhost/periodical/sync-magazine/"
authors: "F. W. Manders"
volume: "2"
issue: "3"
issues_articles:
  - id: 26643
    title: "SYNC v2 n3"
    type: "issue"
    url: "http://localhost/issue/sync-v2-n3/"
pages: "46-47"
pubdate: "May/June 1982"
archive_link: false
volumeissue: "v2n3"
---

# Storing 3-Letter Words in an Array

I wanted to develop a method of storing as many three-letter words as possible in my 1K ZX80). using as little memory as possible. The solution is based on the fact that charaeter numbers of the letters can be compounded into a single number, which can be stored in an array element. Thus three letters can be stored in two bytes.