OpenParable
Skip to content
← Back to skills

Data Structure Selector

Development
data-structure-selector

Data Structure Selector is an Agent Skill for development published in the a5c-ai/babysitter repository on GitHub: a SKILL.md instruction file an AI agent can load to do this task.

Select optimal data structure based on operation requirements

View on GitHub ↗
QUICK START

How to use this skill

Bring this guide into your coding agent with a prompt tailored to the tool you use.

  1. Open your project in Codex.
  2. Copy and paste the prompt below.
  3. Review files and risks before approving any action.
Prompt to paste
Inspect the Agent Skill at https://github.com/a5c-ai/babysitter/blob/HEAD/library/specializations/algorithms-optimization/skills/data-structure-selector/SKILL.md and all supporting files. Report provenance, permissions, scripts, dependencies, and security risks. Propose an exact installation into .agents/skills/data-structure-selector, but wait for my approval before writing files or running scripts.

Copying this prompt does not install or run the skill. Review third-party files before use.

Data Structure Selector Skill

Purpose

Select the optimal data structure based on required operations, their frequencies, and time/space constraints.

Capabilities

  • Analyze required operations (insert, delete, query, update)
  • Match to optimal data structure
  • Consider time/space trade-offs
  • Suggest augmentations for custom requirements
  • Compare alternatives with complexity analysis

Target Processes

  • data-structure-implementation
  • algorithm-implementation
  • complexity-optimization

Selection Framework

Operation Analysis

  1. What operations are needed?
  2. What are the frequency/priority of each operation?
  3. What are the constraints (N, Q, time limit)?
  4. Is persistence needed?
  5. Are range operations required?

Common Selection Patterns

OperationsBest Choice
Insert, Delete, SearchBST / Hash Map
Range sum, Point updateFenwick Tree
Range query, Range updateSegment Tree + Lazy
Union, FindDSU
Min/Max with add/removeMultiset / Heap
Predecessor/SuccessorOrdered Set / BST

Input Schema

{
  "type": "object",
  "properties": {
    "operations": {
      "type": "array",
      "items": {
        "type": "object",
        "properties": {
          "name": { "type": "string" },
          "frequency": { "type": "string" },
          "constraints": { "type": "string" }
        }
      }
    },
    "constraints": { "type": "object" },
    "preferences": { "type": "array" }
  },
  "required": ["operations"]
}

Output Schema

{
  "type": "object",
  "properties": {
    "success": { "type": "boolean" },
    "recommended": { "type": "string" },
    "complexities": { "type": "object" },
    "alternatives": { "type": "array" },
    "augmentations": { "type": "array" },
    "reasoning": { "type": "string" }
  },
  "required": ["success", "recommended"]
}