search

emory-courses / dsa-java

Data Structures and Algorithms in Java
https://emory.gitbook.io/dsa-java/
42 stars 55 forks source link

[QZ#6] DisjointSet Grading Question #182

Closed chenda2000 closed 3 years ago

chenda2000 commented 3 years ago

I got a point off of my DisjointSetQuiz implementation:

-1 Correctness: Expected: [1, 3, 3, -5, 3], Got: [3, 3, 3, -5, 3]

But when I run my code, I get the correct tree [1, 3, 3, -5, 3] using the baseline find() method. Using the efficient find() gives [3, 3, 3, -5, 3].

According to the assignment page, we were supposed to assume that we were using the baseline version of find() for the implementation, so I was wondering if this was a mistake?

lujiaying commented 3 years ago

Oh you are correct. I used the efficient version to examine your implementation. The grade would be recover.

lujiaying commented 3 years ago

Sorry for the mistake.