Digital Signal Processing (DSP) is an important and integral component of Wireless Communications, Speech, Image and Video Processing in particular and of Electrical Engineering in general. With the advancement in integrated technology, sophisticated algorithms have been designed and implemented on the machines to achieve the results of many complex problems related to real world phenomena. In this paper, we thus propose an algorithm which facilitates the instructors teaching DSP course in class to do manual computation of N-point discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) of a complex data signal, x[n] with ease in time domain. We show in our analysis and through numerical results that our proposed algorithm is more efficient than the direct computation of N-point DFT and IDFT of x[n]. It further provides 50 percent saving in terms of real additions (RAs), real multiplications (RMs) and real arithmetic operations (RAops) using our proposed algorithm in comparison with the direct computation of N-point DFT and IDFT of x[n] for large N preferably (N ≥ 1000). Moreover, for real data, our percentage saving in the form of real arithmetic operations remains unchanged even if we compute its N-point DFT and IDFT using the proposed algorithm.