如何找到给定的序列是我已实现的AP（算术级数）或GP（几何级数）（生成序列）AP& GP在我以前的一些基本C练习中分别进行了... [英] How to find given sequence is AP(arithmetic progression) or GP(geometric progression) I have implemented(generated the sequences of) AP & GP separately in some of my previous exercises in basic C...

问题描述

确定序列类型的简单方法算术或几何级数

Simpler way to determine type of sequence Arithmetic or Geometric progression

推荐答案

我们不做你的作业：它是有原因的。它就是为了让你思考你被告知的事情，并试着理解它。它也在那里，以便您的导师可以识别您身体虚弱的区域，并将更多的注意力集中在补救措施上。



亲自尝试，你可能会发现它不是你想的很难！

We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.

Try it yourself, you may find it is not as difficult as you think!

如果你已经单独实现它们，那么合并它们应该非常简单。我首先尝试确定给定序列是否为AP，并在失败时重复测试。

If you have implemented them separately then it should be pretty straightforward to merge them. I would first try to determine if the given sequence is an AP and, upon failure, repeat the test with the GP.

这篇关于如何找到给定的序列是我已实现的AP（算术级数）或GP（几何级数）（生成序列）AP& GP在我以前的一些基本C练习中分别进行了...的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！