How to Write a Counting Function in Lisp for a Data Structure of Pairs

In summary, The task is to write a function that counts the number of times a symbol appears in a nested data structure. The example given is a list of pairs, where the function should return the number of times the symbol "a" appears. The attempted solution provided is a basic counting function, but the student is unsure how to apply it to a specific element in the list. They are seeking guidance on how to proceed.
  • #1
Kamekui
14
0

Homework Statement



Write a function (count s x) that searches a data structure composed of pairs
(arbitarily nested) for a symbol x and returns the number of times it occurs.

Homework Equations



Assuming you have the correct function written, you should get the following:

(count '((a . b) b c () a . d) a) should return 2.

The Attempt at a Solution



I don't really know much about lisp, we just started talking about it. I do know how to write a very basic counting function, that just counts every element in a list:


(defun count-elements(L)
(cond ((null l) 0)
((atom l) 1)
(t (+ (count-elements (car l))
(count-elements (cdr l))))))


So, how would I pick out a specific element in my list?
 
Physics news on Phys.org
  • #2
I'm assuming I need some kind of loop, but I'm not sure how to go about that. Any help would be appreciated.
 

What is the "Common Lisp Counting problem"?

The Common Lisp Counting problem refers to the challenge of efficiently counting the number of occurrences of a specific element in a list or sequence using the Common Lisp programming language. It is a common problem encountered in many programming tasks and requires a good understanding of the language's built-in functions and data structures.

What data structures are commonly used to solve the Common Lisp Counting problem?

The most commonly used data structure for solving the Common Lisp Counting problem is the list. However, other data structures such as arrays, hash tables, and trees can also be used depending on the specific problem and the data being counted.

What are some built-in functions in Common Lisp that can be used for counting?

Common Lisp has several built-in functions that can be used for counting, including count, count-if, count-if-not, count-duplicates, and count-if-duplicates. These functions take in a list or sequence and return the number of elements that satisfy the given condition.

What are some common strategies for solving the Common Lisp Counting problem?

One common strategy for solving the Common Lisp Counting problem is to use recursion. This involves breaking down the original list into smaller sublists and counting the occurrences in each sublist. Another strategy is to use built-in functions such as reduce or loop to iterate through the list and keep track of the count. Additionally, using hash tables or trees can also be an efficient approach for certain counting problems.

What are some common challenges encountered when solving the Common Lisp Counting problem?

One of the main challenges when solving the Common Lisp Counting problem is ensuring that the code is efficient and does not have a high time complexity. This requires careful consideration of the chosen data structure and algorithm. Another challenge is handling edge cases and special scenarios, such as counting occurrences of sublists or nested elements, which may require additional logic and handling.

Similar threads

Comp Sci Learn How to Write Pseudocode: Questions Answered!
    • Engineering and Comp Sci Homework Help
Replies
15
Views
3K
Doing a Count in Access 2013 Query -- How to?
    • Engineering and Comp Sci Homework Help
Replies
3
Views
922
Learning Data Structures in Java: Circular Queue
    • Engineering and Comp Sci Homework Help
Replies
3
Views
1K
I don't understand kind of program the instructions want
    • Engineering and Comp Sci Homework Help
Replies
4
Views
2K
[C] Use recursive function to get the min value of an array
    • Engineering and Comp Sci Homework Help
Replies
5
Views
3K
How many ways to count to 20 with positive integers and x > 3?
    • Calculus and Beyond Homework Help
Replies
22
Views
2K
Comp Sci Implementing a PriorityQueue w/ a Doubly-Linked List (Java)
    • Engineering and Comp Sci Homework Help
Replies
2
Views
3K
Assistance needed writing a C program
    • Engineering and Comp Sci Homework Help
Replies
7
Views
2K
MHB Can anyone help me reverse a list in Lisp without using the reverse function?
    • Programming and Computer Science
Replies
7
Views
8K
Challenge: Find the minimum amount of draws possible for a list of integers
    • Programming and Computer Science
Replies
9
Views
1K

Hot Threads

Recent Insights

Back
Top